System and method for automated symbolic recognition including logical symbols

ABSTRACT

An automated symbolic recognition system and method includes the basis for the system&#39;s feature set by identifying (a) a set of logical symbols comprising a finite class of arcpolys (lines and arcs and a point) that to the exclusion of the point, each member class has a unique (distinct) orientation, and (b) a set of subclass symbols per logical class of symbol representing a finite subclass of arcpolys (lines and arcs and a point) that to the exclusion of the point, each subclass member has a unique (distinct) extreme points size and/or depth size.

I. RELATED APPLICATIONS

This application has subject matter that is related to the followingapplications filed on the same day:

-   -   Application Ser. No. 10/419,479 titled SYSTEM AND METHOD FOR        AUTOMATED SYMBOLIC RECOGNITION INCLUDING DATABASE MODELING    -   Application Ser. No. 10/419,483 titled SYSTEM AND METHOD FOR        AUTOMATED SYMBOLIC RECOGNITION INCLUDING SPATIAL REASONING    -   Application Ser. No. 10/419,482 titled SYSTEM AND METHOD FOR        AUTOMATED SYMBOLIC RECOGNITION INCLUDING EVIDENCE-BASED        TECHNIQUE    -   Application Ser. No. 10/419,480 titled SYSTEM AND METHOD FOR        AUTOMATED SYMBOLIC RECOGNITION INCLUDING MULTI-PHASE SYMBOLIC        RESHAPING

II. BACKGROUND OF THE INVENTION

1. Field of Invention

This invention relates generally to an apparatus for recognizinghandwritten text and alphanumeric symbols, and more particularly to amethod and system for recognizing handwritten text and alphanumericsymbols that includes a pen and digitizing tablet for real time entry ofhandwritten alphanumeric symbols by a user and in certainimplementations to a system that includes a document scanner forgenerating scanned images of a previously created document containinghandwritten alphanumeric symbols.

2. Description of the Related Technology

Computer vision encompasses a wide range of markets, applications, andcustomer needs. According to industry analysts, market demand isgravitating towards a system line whose production process isre-examined to achieve high cost-efficiency.

The ability to recognize handwritten text and alphanumeric symbols isvery important in many applications, such as pen-based computer systems,automated mail routing systems, bank check recognition, and automaticdata and text entry from business forms. Handwriting recognizerstransform text in bit map representation to a high level (i.e., ASCIIalphanumeric) coded representation. Pen-based computer systems translatepen motions generated by a user into a sequence of X and Y pointsindicating the locations of the pen on the tablet. In offlinehandwriting recognition systems, text on a printed surface such as asheet of paper are typically scanned by an optical scanner which createsa bit map of the pixels (or points) belonging to the image. Therecognized alphanumeric symbols may be used for analysis, editing, orother forms of processing via an application software running on acomputer.

Computer-aided handwriting recognition is a technology that iscontinually evolving. A variety of writing styles, combined with poorpenmanship continues to stymie researchers' attempts to design a robustsystem that can decode all forms of handwriting. Currently, textsproduced by state-of-the-art handwriting recognizers contain anunacceptable frequency of errors. This prevents the technology frombeing efficiently used for large-volume information transfer. Today'smost advanced commercial systems are at best at reading legiblehandwriting letters and numbers in predefined form. The reportedaccuracy results can be only achieved with careful writing bycooperative users.

The rapid and robust identification of alphanumeric symbols that lackstandardized characteristics constitutes a development challenge forhandwriting recognition systems. More particularly, shape, size, spacingand orientation of alphanumeric symbols vary widely from user-to-user,thus resulting in a distinct alphanumeric symbol that exhibit similarshapes. For example, “g” and “9” or “D” and “0” may appear with similarshapes. This problem is compounded when an alphanumeric symbol isgrouped together in a sequence to form a new alphanumeric symbol. Forexample, a “1″-shaped number followed relatively closely by a “3”-shapednumber may be identified as “B”.

There are many proposed methods for handwriting recognition known in theprior art. Rejean Plamondon et. al. present a comprehensive survey ofon-line and off-line handwriting recognition. The majority of thesetechniques that have been developed for handwriting recognition can bebroadly classified as the statistical, structural and the neural networkapproaches as described below:

The statistical approach is based on a similarity measure that in turnis expressed in terms of a distance measure or a discriminant functioninvolving the following three groups: explicit, implicit, and Markovmodeling methods. In this context, a shape is described by a fixedamount of features defining a multi-dimensional representation spacewhereby different classes are described with multi-dimensionalprobability distributions concerning a class centroid. Several examplesof the discriminant functions include linear discriminant and polynomialfunctions, minimum distance, nearest neighbor, and Bayes classifier. Aproblem associated with this approach is that discriminant function canbe quite complex and may involve adjustments to the parameters under alearning scheme. Another problem identified with the statisticalapproach is that relationships between pattern elements are notpreserved.

The fuzzy set theory has played an important role in both statisticaland syntactical approaches. In the neural net approach, the amount ofbuilt-in prior knowledge of the alphanumeric recognition problem mayseriously affect its generalization performance. An advantage of theneural nets is that they provide the degree of membership of the unknownobject in each of the known classes. Moreover, they avoid a long andcostly conventional development process.

In the structural approaches, the premise of the recognition process wasprimarily based on the idea that alphanumeric shape can be described inan abstract fashion. However, syntactical and structural approachesovercome the problem of preserving relationships by storing the image asa tree or graph of pattern elements and their relationships. Adifficulty in implementation of these approaches is defining the patternelements or features, and the relationships between them. In addition,each class or types of images should be separately analyzed anddescribed.

Neural network models use a weight matrix to store information gainedfrom the representation of known images. Ideally, as more instances andtypes of images are added, the system should have an improvement inperformance. However, the performance of the neural nets coulddeteriorate after certain level of learning.

Other methods include, (i) global features (i.e., template matching,transformations), (ii) distribution of points (i.e., zoning, moments,distances), and (iii) geometrical and features. However, each of thesetechniques has its own drawback, as global features are highly sensitiveto distortion and style variation, distribution of points are highlyaffected by the dynamic size and shape variations of hand printedcharacters, and geometrical and features are complex and sensitive tolocal features.

These techniques described above are narrowly focused on a particulartype of recognition approach and more importantly, do not conform to themechanisms underlying alphanumeric formation. Furthermore, these methodshave not solved the signal-to-symbol transition problem and thus rely oncomputations that occur on information derived from images containinglow semantic level, unable to contain the variability problem. Moreover,one of the tenets of vision is that choice of representation is crucialin recognition. Representations must be chosen that make relevantinformation explicit and allow domain constraints to emerge. In thetechniques adopted, very little use is made of a priori information inimages. Finally, the complexity of the task due to intrinsic andextrinsic variations present in the image, with regards to thedevelopment time-line as well as the inherent ill-defined concepts whichin turn yield invalid assessments that have not been dealt with.

III. SUMMARY OF CERTAIN INVENTIVE ASPECTS

One embodiment of the present invention is a handwriting alphanumericrecognition system that includes a pen and digitizing tablet for realtime entry of handwritten alphanumeric symbols by a user and, in certainimplementations, a scanner for generating scanned images of a previouslycreated document containing handwritten text or alphanumeric symbols.

The handwriting alphanumeric system of the invention includes an imageprocessor for receiving the digitized image comprising “imgPolys”ordered polylines, each described by an ordered sequence of X and Ypoints. For the purposes of this disclosure, it is assumed that whenusing a scanner, a series of polylines, each described by a sequence ofX and Y points are derived. The spatial order signifies an induced timeordered sequence of creation of the polylines of the handwrittenalphanumeric symbols which emulates the sequence of creation of thealphanumeric polylines. Thereafter, the image processor operates topre-process the image data to remove jitters and achieve smoothing.

Another embodiment of the invention is the use of a spatial reasoningapproach incorporating a three phase symbolic reshaping schemethroughout the handwriting recognition process that includes: (i)deriving dissimilarity level from alphanumeric ID's net variation andthe integration of each of its arcpoly structural variation(s)signifying a reasonably accurate confidence level for the goodness ofrecognition, (ii) determining the reshaping or transformation of anarcpoly to another arcpoly by introducing variations to the originalarcpoly and deriving at each step, the new cost value as a function ofvariation(s) present and imposed, and (iii) determining the equivalentrepresentation of an arcpoly by a succession of smaller and adjoiningarcpoly(s) in order, or vice versa;

Another embodiment of the invention is performing the first step of athree step process that derives high-level semantic information from theimage data, manifesting as an arcpoly or a sequence of arcpolys perpolyline ID, and then identified by logical- and subclass symbols. Thesymbols are partially derived from a list of primary features, whichdescribe the entire shape and orientation of each arcpoly, and representanother embodiment of this invention. In the step one process, eachpolyline or a sequence of polylines is (are) reduced to one arcpoly or asequence of arcpolys. The arcpoly's descriptors and primary featuresrepresenting the entire shape of the arcpoly(s) are computed. Theprocess involves: a first module capable of a pre-established criteriabased region growing; a second module that involves a three levelpost-processing technique capable of a pre-established criteria basedregion segmentation for over-grown arcpoly(s) to split each into twoadjoining arcpolys; and a third module for computing spatial variables(i.e., text line characteristics) pertaining to the polylines andarcpolys computed above. Arcpolys are mathematically described in the“Semantics” Section and are devised in a manner so that theirrepresentation conforms as best as possible to pre-stored logical- andsub-class-symbols pairs. This first step represents the third phase ofthe symbolic reshaping scheme described above.

Another embodiment of the invention is performing the second step of thethree step process described above that includes: a first module whereinan alphanumeric ID's connection code(s) are computed to describerelationships amongst all pair(s) of arcpoly(s) and polyline(s)belonging to the alphanumeric ID; a second module whereby each arcpoly'sfeature size values is normalized; and a third module whereinpolyline(s) and their arcpoly(s) as well as their relationship(s) aregrouped (or registered) to each alphanumeric ID.

Another embodiment of the invention is the incorporation of (i) genericand exemplar models of alphanumeric symbols and (ii) support informationfor the entire handwriting recognition process. The database ispotentially dynamic in the sense of being capable of a continualself-updating of its contents.

The database in (i) contains structural models for both generic and aselective set of exemplars for each alphanumeric symbol by employing thecommon-property concept in which an alphanumeric symbol is identified byprimitive elements and their relationships, as described in theIntroduction Section. The exemplars are determined empirically byconducting multiple experiments on multiple users.

The database in (ii) contains information to support the recognitionprocess via efficient collecting of intelligence regarding pertinent andcontext dependent evidence and includes “structure-to-alphanumeric”,“topology-to-alphanumeric” and “collective evidence” modules. Theinformation compiled here is obtained by conducting multiple experimentson multiple users and in part is used for deriving a reasonably accurateset of values for ill-defined variables with a fuzzy nature. Forexample, as discussed in the later Sections, the computation of the(primary) relational features for the existing logical symbolsrepresenting feature variances in reference to the features pre-storedin the data-base uses the information stored in the database's“structure-to-alphanumeric” and “topology-to-alphanumeric”modules.Moreover, as discussed in the later Sections, the values associated withthe extreme points codes; the “ptCode” vector is a part of the“collective evidence” database content.

Another embodiment of the invention is performing the final step of thethree step process described above. This is achieved by computinglogical- and subclass-symbols pair(s) from the image data, as well as bycomputing (primary) relational features for each arcpoly representingfeature variances in reference to the features pre-stored in thedata-base by using the information stored in the database's“structure-to-alphanumeric”, “topology-to-alphanumeric”, and “collectiveevidence” modules. The relational features are derived in part from aset of primary features that describe the entire shape and orientationof the arcpoly(s). The final step represents the first phase of thesymbolic reshaping scheme described above.

Another embodiment of the invention involves the significant reductionof the alphanumeric candidate symbols' search range by employing anevidence-based technique that uses the information stored in thedatabase's “generic and exemplar models” module. The currentknowledge-based system for handwriting recognition contains in itsdatabase a set of links from each pair of logical-sub-class-symbols totheir superset alphanumeric candidate symbols as well as a set of linksfrom each encoding and separation pertaining to polyline and arcpolyconnection code(s) to their superset alphanumeric candidate symbols. Itis the premis of evidence-based strategy that for the former list, thealphanumeric symbol(s) that emerge(s) repeatedly (or commonly) for everypolyline and arcpoly, and for the latter list, the alphanumericsymbol(s) that emerge(s) repeatedly for all connection code(s) peralphanumeric ID is (are) more likely to be the correct alphanumericsymbol than those that did not. Cross referencing these two lists ofalphanumeric symbols may yield a shorter list of alphanumeric candidatesymbols, possibly at a cost of reducing the accuracy of the resultingcandidate symbols, as the encodings do not always reliably invoke thecorrect alphanumeric symbol due to the intrinsic and extrinsicvariations present in the image data. Consequently, the determination ofthe alphanumeric candidate symbols at times, may exclude the list ofalphanumeric candidate symbols generated by encodings.

Yet another embodiment of the invention includes database's alphanumericcandidate symbol selection: a first module capable of compiling apossibly shorter list of all such non-discarded list of alphanumericcandidate symbol(s) as derived above; a second module capable ofcomputing their (its) secondary relational features which are used inpart to recognize the alphanumeric symbol(s) via the derivedalphanumeric cost (or dissimilarity) levels that serve to determine howlikely the hypothesized alphanumeric symbol identified is achievedcorrectly; a third module capable of determining the best alphanumericcandidate symbol based on its confidence level and the number of matchedpair(s) of arcpoly(s) and their logical- and subclass-symbols pair(s);and a fourth module to establish its validation.

Still another embodiment of the invention includes (i) the determinationof alternative set(s) of reduced lists of alphanumeric candidate symbolsper alphanumeric ID, each set accompanied by descriptors and secondaryrelational features as well as confidence levels, (ii) selection of thebest database alphanumeric candidate symbol for each incident and (iii)validation of the alphanumeric candidate symbol for each incident; bysuccessive symbolic transformation of logical- and subclass-symbolspair(s) to one another, or equivalently stated, reshaping/ortransformation of arcpoly(s) by using the information stored in thedatabase's “generic and exemplar models” module. The step (i) describedabove represents the second phase of the symbolic reshaping schemedescribed above and includes structural, and combined reshapingprocesses. Examples of such a process includes but not limited to thefollowing: arc-to-arc rotation, line-to-line rotation, arc depth sizevariance, arc extreme points size variance, existence/or absence of arcextension on each (or both) extreme point(s), line extreme points sizevariance, variances, and combined variances.

IV. BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram illustrating the logical- and subclass symbols andfeatures belonging to an arcpoly.

FIG. 2 is a diagram illustrating both the low resolution encoded valuesderived from a 8-direction and the high resolution encoded valuesderived from a 16-direction code system.

FIG. 3 is a flow diagram illustrating the overall handwritingrecognition system.

FIG. 4 is a flow diagram illustrating the computation of arcpolys andtheir spatial descriptors.

FIG. 5 is a flow diagram illustrating the computation of arcpolys.

FIG. 6 is a flow diagram illustrating the computation of hypothesizedarcpoly(s).

FIG. 7 is a flow diagram illustrating the computation of low resolutionelement direction.

FIG. 8 is a flow diagram illustrating the preprocessing techniques.

FIG. 9 is a flow diagram illustrating the computation of polyline“line-based” representation.

FIG. 10 is a flow diagram illustrating the computation of highresolution line direction.

FIG. 11 is a flow diagram illustrating the computation ofpost-processing II on arcpoly(s).

FIG. 12 is a flow diagram illustrating the computation of arcpoly “k”primary features that exclude the determination of extension(s).

FIG. 13 is a flow diagram illustrating the computation of extreme pointssize.

FIG. 14 is a flow diagram illustrating the computation of alignmentlevel between a pair of line directions.

FIG. 15 is a flow diagram illustrating the determination of the Booleanvariable “direction exceed”.

FIG. 16 is a flow diagram illustrating the determination of type Isegmentation.

FIG. 17 is a flow diagram illustrating the computation ofclockwise-based and modular 16-based pair-wise direction difference.

FIG. 18 is a flow diagram illustrating the computation of theprobability associated with the derived value for the abrupt directionchange.

FIG. 19 is a flow diagram illustrating the determination of type IIsegmentation.

FIG. 20 is a flow diagram illustrating the determination of type IIIsegmentation.

FIG. 21 is a flow diagram illustrating the determination of type IVsegmentation.

FIG. 22 is a flow diagram illustrating the determination of type Vsegmentation.

FIG. 23 is a flow diagram illustrating the computation of arcpoly “k”post-processing III.

FIG. 24 is a flow diagram illustrating the determination of arcpolybackward direction search for over-extension index.

FIG. 25 is a flow diagram illustrating the determination of arcpolyforward direction search for over-extension index.

FIG. 26 is a flow diagram illustrating the computation of spatialvariables.

FIG. 27 is a flow diagram illustrating the computation of ‘textline’-based spatial variables.

FIG. 28 is a flow diagram illustrating the computation of allalpha-numeric IDs and their features.

FIG. 29 is a flow diagram illustrating the computation of encodings.

FIG. 30 is a flow diagram illustrating the computation ofhigh-resolution line direction and directions gradient.

FIG. 31 is a flow diagram illustrating the normalization of arcpolys'feature sizes.

FIG. 32 is a flow diagram illustrating the computation of alphanumericsymbols' height threshold.

FIG. 33 is a flow diagram illustrating the determination of encoding(s)for each alphanumeric symbol.

FIG. 34 is a flow diagram illustrating the computation of logicalsymbols and their secondary relational features for all non-discardedreduced alphanumeric candidate symbol list.

FIG. 35 is a flow diagram illustrating the computation ofpost-invocation secondary relational features and the determination ofthe “discard” vector.

FIG. 36 is a diagram illustrating the type of smoothing that is selectedfor the given element directions' gradient.

FIG. 37 is a diagram illustrating a look-up table as part of thecollective evidence database for the computation of a new sequence of Xand Y point locations from the revised series of low resolutiondirections.

FIG. 38 is a diagram listing the descriptors of an arcpoly, illustratingan example of a polyline, and a bounding box.

FIG. 39 is a diagram illustrating (i) the derivation of the motionclockwise direction (or the direction of rotation) and the depthdirection by way of example, and (ii) the text characteristic lines forone or more lines of text within the image.

FIG. 40 is a diagram illustrating (i) a look-up table as part of thecollective evidence database for the derivation of the connection status(code) for adjoining arcpoly(s) (if any) pertaining to all the doublepairs and the first connection and option, and (ii) the determination ofa bounding box for polyline “q1”.

FIG. 41 is a diagram illustrating (i) the distances involved inestablishing the Boolean variable “near” whereby “near=1” signifiesmerger between the double pair structures, “p1”, “k1” and “p2”, “k2,(ii) elevated bar- and cross-type polylines by way of example, and (iii)saddle points (local minima and maxima) by way of example.

FIG. 42 is a diagram describing an alphanumeric candidate symbol's listof secondary relational features.

FIG. 43 is a diagram illustrating structural invocations by way ofexample.

FIG. 44 is a diagram illustrating invocations by way of example.

FIG. 45 is a diagram illustrating the assimilated polyline “p”, arcpoly“k” features and the descriptors of alphanumeric “a”.

FIG. 46 is a diagram illustrating the condition “op.”

FIG. 47 is a diagram illustrating a look-up table as part of thecollective evidence database to compute “codeCnc.”

FIG. 48 is a diagram illustrating a look-up table as part of thecollective evidence database to revise “osubcc.”

FIG. 49 is a diagram illustrating a look-up table in the collectiveevidence database to compute “fromSubcc” and “toSubcc.”

FIG. 50 is a diagram illustrating the structural reshaping by way ofexample.

FIG. 51 is a diagram illustrating the values for the extreme pointscodes, the “ptCode” vector, as part of the collective evidence database.

FIG. 52 is a diagram illustrating the computation of the point location,“rpt”, “cpt”, as part of the collective evidence database.

FIG. 53 is a diagram illustrating the derivation of “pt_code” by way ofexample, as part of the collective evidence database.

FIG. 54 is a diagram illustrating process 3704 for the computation oflogical symbols.

FIG. 55 is a diagram illustrating process 3584 for the derivation ofremaining sub-class symbols per logical symbol.

FIG. 56 is a diagram illustrating the results of the derived variancetypes and levels as part of the collective evidence database.

FIG. 57 is a diagram illustrating the list of the values for the “sc_e”,“sc_d”, “sc_x” and “size” vectors, as part of the collective evidencedatabase.

FIG. 58 is a diagram illustrating a list of variables pertaining to thedatabase's “structure-to-alphanumeric models”, “topology-to-alphanumericmodels”, “generic and exemplar models”, and “collective evidence.”

FIG. 59 is a flow diagram illustrating the computation of “discard[any]”and “tp1VL[a][idxc1].”

FIG. 60 is a flow diagram illustrating the computation of“tp1VL[a][idxc1]” provided that “mtchq” has a value of one.

FIG. 61 is a flow diagram illustrating the determination of the bestalpha-numeric candidate symbol accompanied by its secondary relationalfeatures.

FIG. 62 is, a flow diagram illustrating the computation of structuralre-shaping based alphanumeric candidate symbol selection and validation.

FIG. 63 is a flow diagram illustrating the computation of the image anddatabase deviations for the remaining sub-class symbols per rotationlevel, “level1.”

FIG. 64 is a flow diagram illustrating the computation of the image anddatabase deviations for changes in extreme points size and depth sizeper rotation level, “level1.”

FIG. 65 is a flow diagram illustrating the computation of the remainingsub-class symbol's newly transformed arcpoly(s) and (its) theirrelational features.

FIG. 66 is a diagram illustrating the feature set definitions forpolyline “p”, arcpoly “k”, and line “1”.

V. DETAILED DESCRIPTION OF CERTAIN INVENTIVE EMBODIMENTS

Those of ordinary skill in the art will acknowledge that the followingdescription of the present invention is solely illustrative and not inany way limiting. The disclosed embodiments of the present inventionwill readily suggest themselves to such skilled persons. Furthermore,for the purposes of this disclosure, it is assumed that the alphanumericsymbols in the image are already segmented by an alphanumeric segmenter.

The following detailed artificial intelligence approach presents adescription of certain specific embodiments of the present invention. Inthis description, reference is made to the drawings wherein like partsare designated with like numerals throughout. The processes presented indetail incorporate mathematical/or coding notations similar to those ofthe C++ code and the daily common sense notations we are accustomed to.Furthermore, variables with a fuzzy nature that have been derivedempirically are frequently cited, as this is a natural occurrence formost vision systems. Those of ordinary skill in the art will realizethat such variables are continually in a state of flux and depend to agreat extent on the resolution and accuracy of the digitizing apparatusused for the handwriting recognition process and depend on experimentsperformed on multiple users. The information contained in the databaseto support the recognition process described above was used toempirically derive a reasonably accurate set of values for suchill-defined variables with a fuzzy nature.

For convenience, the discussion of the invention is organized intofollowing principal sections: Introduction, High-Level Semantics Part I,High-Level Semantics Part II, High-Level Semantics Part III, Candidatesand Validation, and Symbolic Reshaping.

Introduction

1. Approach

The two key problems for the absence of robust image understandingalgorithms are the following: (a) computations occur on low semanticlevels of the image, thus unable to contain the variability problem, and(b) very little use is made of a priori information related to andpresent in the image. A spatial reasoning approach to handwritingrecognition is able to capture high-level semantic information from theimage and fully exploit the information present in each image.

As an embodiment of the invention, in order to formulate an efficientstrategy for the development of handwriting recognition system thatadopts a spatial reasoning approach, several interrelated issues raisedearlier are addressed below and discussed in detail in the followingsections:

1) It is generally known that handwriting recognition methods are morerobust when they are related to the mechanisms underlying alphanumericformation. Studies performed with preschool children suggest thatalphanumeric symbols may indeed be reduced to their respective logicalcomponents before recognition can occur. Perceptual studies, the studyof techniques employed by humans to distinguish between pairs ofalphanumeric symbols, led to a theory of alphanumeric set based onfunctional attributes. From the point of view of cognitive psychology,modeling the process of handwriting recognition generation led torecognition methods using analysis-by-synthesis, and perceptual studiesled to some form of pairwise-distinction methods.

Such information constitutes supporting evidence for the use of thecommon-property concept, in which an alphanumeric symbol is identifiedby primitive elements and their relationships. An embodiment of thisinvention is specifying these elements, namely logical- andsubclass-symbols and their major points, and encoding each logicalsymbol as a symbol identity, as shown in FIG. 1. Accordingly, thealphanumeric logical symbols comprise a point, a class of arc and aclass of line arcpolys, mathematically described in the followingsection. The integer values 0, and 20 designate an arcpoly's extremepoints and the integer value 10 represents an arcpoly's mid-point. Thethree integer values represent the arcpoly's major points. Anotherembodiment of this invention is establishing relationship(s) betweenlogical- and subclass-symbols pair(s) belonging to each modeledalphanumeric symbol.

Within each class of logical symbols, FIG. 1 illustrates a number ofsub-class symbols signifying various extreme points' size and depth sizevariations of its class. An embodiment of this invention is specifying(i) a subset of these primitive element adaptation(s) and (ii) themanner they are positioned with respect to one another to best conformto modeled alphanumeric symbols.

2) Requiring computations to occur on high-level semantics is equivalentto solving the signal-to-symbol transition, as described in detail inthe following principal sections: High-Level Semantics Parts I, II andIII.

3) The effective use of a priori information involves the incorporationof (i) generic models, (ii) case (or exemplar) models, and (iii)effective use of supporting information (intelligence) (see FIG. 3).

4) Dealing with the inherent complexity issue involves the following:

-   -   i) devise a hybrid system whereby computations employed are both        data-directed and model-driven (see FIG. 3),    -   ii) incorporate multiple representations of each alphanumeric in        the database by identifying a finite number of generic and        exemplar representations per alphanumeric symbol,    -   iii) devise the basis for the system's feature set (see FIG. 1)        by identifying (a) a set of logical symbols comprising a finite        class of arcpolys (lines and arcs and a point) that to the        exclusion of the point, each member class has a unique        (distinct) orientation, and (b) a set of subclass symbols per        logical class of symbol representing a finite subclass of        arcpolys (lines and arcs and a point) that to the exclusion of        the point, each subclass member has a unique (distinct) extreme        points' size and/or depth size    -   iv) establish a hierarchical hypothesis-and-verification        technique during various stages of the handwriting recognition        process, whereby a series of initial assessments are made based        on the information availed upon them and later during processing        they are validated or rejected depending on the degree in which        preset milestones were satisfied and are followed by a sequence        of alternative hypotheses in the event of failure of the latest        hypothesis until they are satisfied (i.e., post-processing        processes 156, 158, and 160),    -   v) adopt an evidence-based technique to reduce the alphanumeric        candidate symbol list significantly (see candidates and        validation section),

vi) incorporate a three phase symbolic reshaping scheme during thehandwriting recognition process that includes (i.e., see FIG. 50): (a)deriving dissimilarity level from alphanumeric ID's net variation andthe integration of each of its arcpoly structural variation(s)signifying a reasonably accurate confidence level for the goodness ofrecognition, thus establishing a mechanism that derives dissimilaritylevel (or cost value) between image and database features includingshape, size and relationship (i.e., see FIG. 56), (b) determining thereshaping or transformation of an arcpoly to another arcpoly byintroducing variations to the original arcpoly to alter its shape andorientation and deriving at each step, the new cost value as a functionof variation(s) present and imposed, and (c) determining the equivalentrepresentation of an arcpoly by a succession of smaller and adjoiningarcpoly(s) in order, or vice versa;

There are several remarkable issues in connection with the symbolicreshaping scheme, as discussed in item (vi) above.

1. The reshaping or transformation of an arcpoly (represented by itsdescriptors and secondary relational features that include the logical-and sub-class-symbols pair(s)) to another arcpoly (with a new set ofdescriptors and secondary relational features that may include revisedpair(s) of logical- and sub-class-symbols) can be attained symbolically.This is achieved by taking into account the structural reshaping processincrementally and then combining each step's effect to achieve a newarcpoly. Note that at each step, the cost value is computed bydetermining the type of variation present and while taking into accountthe costs associated during matching (if any) with database missedlogical and sub-class symbol pair(s) and/or surplus (or extra) imagelogical and sub-class symbol pair(s) per arcpoly. Thus, the additionaldissimilarity level derived is integrated into the net dissimilaritylevel to generate each alphanumeric candidate symbol's cost value (ordissimilarity level) as a representation of the goodness of recognition.

2. There is no cost value (dissimilarity level) associated with thethird phase of the symbolic reshaping scheme.

3. The incorporation of the three phases of the symbolic reshapingscheme in concert throughout the handwriting recognition system cansignificantly improve the system's capability, as they represent apowerful tool for the recognition process.

2. Semantics (Glossary)

The hierarchical descriptions of geometrical structures are presentedbelow:

A) Point—Ordered pair (i, j). Note that the point shown as a logicalsymbol and subclass symbol in FIG. 1 is in a practical sense, a verysmall arcpoly described in Step H below.

B) Element—Two ordered pairs ((i,j), (i+v, j+w)), where:

-   -   v=−1, 0, or 1,    -   w=−1, 0, or 1, and    -   v!=0 if: v=w.

C) Element Direction—Low resolution encoded value derived from a8-direction code system, an adaptation of “Freeman Chain Codes,” asillustrated in the top portion of FIG. 2,dv _((k)) =f(m _((k)) ,n _((k))), where:

-   -   m_((k))=(i_((k+1))−i_((k)))    -   n_((k))=(j_((k+1))−i_(jk)))

D) Line—Set of elements [(i_((k)), i_((k))), ((i+V)_((k)),(j+w)_((k)))], for all k=1, . . . , n, subject to:

a) connectivity:

-   -   ((i+v)_((k))=(i)_((k+1)) for all k=1, . . . , n−1    -   ((j+w)_((k))=(j)_((k+1))

b) equal directions:

-   -   dv_((k))=dv_((k+1)) for all k=1, . . . , n−1,        where n is the number of elements.

E) Line Direction—High resolution encoded value derived from a16-direction code system, as illustrated in the bottom portion FIG. 2,dv _((k)) =f(m _((k)) ,n _((k))), where:

-   -   m_((k))=(i_((k+1))−i_((k)))    -   n_((k))=(j_((k+1))−i_(jk)))

E) Clockwise motion—A Boolean variable that describes the directionchange of a structure's (k+1)^(th) line with respect to its k^(th) line:

-   -   cw_((k))=true, if: dv_((k+1))=(dv_((k))+u)_(modular m), where        m=8 or 16    -   cw_((k))=false, otherwise    -   where, in general:    -   (v)_(modular m)=v−m, if: v>m    -   (v)_(modular m)=v+m, if: v<1    -   (v)_(modular m)=v, otherwise

G) Arc—Set of Lines, subject to

a) connectivity:

-   -   ((i+U)_((s(k)))=(i)_((s(k)+1)) for all k=1, . . . , n−1    -   ((j+w)_((s(k)))=(j)_((s(k)+1))

where, n is the number of lines and s(k) refers to the number ofconsecutive elements up to the k^(th) line.

b) consistent_((n))=true, or equivalently, cw_((k+1))=cw_((k+2)) for allk<0, . . . , n−2.

H) Net Gradient Directions—The accumulation of direction differences inan 8/or 16 direction code system of all adjoining pairs of linesbelonging to an arc

I) Arcpoly—Comprises an arc, line, or a point and is constrained by itsnet gradient directions not exceeding a pre-specified value (see FIG.1).

J) Polyline—Set of arcpoly(s) subject to,

a) connectivity:

-   -   ((i+u)_((v(s(k))))=(i)_((v(s(k))+1)) for all k=1, . . . , n    -   ((j+w)_((v(s(k))))=(j)_((v(s(k))+1))

where, n is the number of arcpolys and s(k) refers to the number oflines up to the k^(th) arcpoly, and v(s(k)) is the number of elements upto the s(k)^(th) line.

b) consistent_((s(n)))=false.

K) Image Structure—Comprises a point, line, arc, arcpoly, or polyline.

L) Descriptors—Description of an image structure via the sub-structuresthat make up the image structure (i.e., an arcpoly described by itssuccessive lines that make up its structure) as well as its features.

M) Relational Features—A gradient feature set between database featuresand arcpoly features derived from the image that enable the derivationof the dissimilarity values between the two arcpolys.

N) High-Level Semantic Information—Refers to each of the derivedlogical- and subclass-symbols pairs and their features with thefollowing characteristics:

-   -   a) Targets the largest image structure derived to generate an        arcpoly from the image data, while at the very least adhering to        the definition of arcpolys described in this Section described        above (via region growing and in some situations followed by        region splitting).    -   b) Each arcpoly derived is uniquely described.    -   c) The description contains a rich semantic content whereby no        higher representation can be derived from the current feature        set without compromising the alphanumeric symbols'        discrimination capability.

O) Logical Symbols—Represents a finite class of arcpolys (lines and arcsand a point) that to the exclusion of the point, each member class has aunique (distinct) orientation (see FIG. 1).

P) Subclass Symbols—Represents a finite subclass of arcpolys (lines andarcs and a point) that to the exclusion of the point, each subclassmember has a unique (distinct) extreme points' size and/or depth size(see FIG. 1).

3. Overall System Flow Diagram

FIG. 3 is a flow diagram illustrating the handwriting recognition systemaccording to a presently preferred embodiment of the invention. For thepurposes of this disclosure, it is assumed that the alphanumeric symbolsare hand printed, or cursive and have been already segmented by analphanumeric segmenter. The overall process begins at a start state 80and then moves to state 82 wherein handwritten input is collected usinga digitizing tablet and a pen, and in certain implementations, a scannerfor generating scanned images of a previously created documentcontaining handwritten text or alphanumeric symbols. The digitized imagecomprises “imgPolys” polylines, each described by a sequence of X and Ypoints. For the purposes of this disclosure, it is assumed that whenusing a scanner, a series of polylines, each described by a sequence ofX and Y points are derived.

Next, as another preferred embodiment of the invention, the process 40moves to state 84 to compute the first step of a three step process thatderives high-level semantic information from the image data to generatearcpolys in a manner that best conforms to their database counter partsand those listed and illustrated in FIG. 1. Thus, another embodiment ofthis invention is that each polyline is reduced to one or a sequence ofarcpoly(s), and then each arcpoly's descriptors and primary featuresrepresenting the entire shape and orientation are computed, as listed inFIG. 45.

As another preferred embodiment of the invention, the primary featurescomprise (i) extreme points' direction, (b) extreme points' size, (iii)depth direction, (iv) depth size, (v) extension, (vi) motion clockwise.Thereafter, the process 40 moves to state 88 to perform the second stepto compute high-level semantic information from the image data whereinrelationship(s) are computed, each arcpoly's feature values describingstructural sizes is normalized, and polyline(s) and their arcpoly(s) aswell as their relationship(s) are grouped to each alphanumeric ID.Structural features comprise a set of features that describe eacharcpoly's entire shape and orientation. Note that terms used during thispresentation such as “alphanumeric ID” refers to the ‘ID+1’^(th)alphanumeric derived from the image and “candidate alphanumeric symbols”refers to modeled alphanumeric symbols stored in the database.

Next, the process 40 moves to state 92 to compute the final step of thederivation of high-level semantic information from the image data. Thisis achieved by computing logical- and subclass symbols pair(s) perarcpoly from the image data for all alphanumeric IDs, as well as bycomputing (primary) relational features for the existing symbolsrepresenting feature variances in reference to the features pre-storedin the data-base. As another preferred embodiment of the invention, thisis achieved by accessing information (i) pertaining to prestoredsymbolic representations of alphanumeric symbols representing all setsof characters stored in the database and (ii) using the database's“structure-to-alphanumeric”, “topology-to-alphanumeric,” and “collectiveevidence” modules illustrated as states 90, 94 and 86, respectively (seeFIG. 58). The current knowledge-based system for handwriting recognitioncontains “structure-to-alphanumeric”, “topology-to-alphanumeric” linksfrom alphanumeric members of the stored candidate alphanumeric list tosymbolic representations derived from arcpolys.

The database is potentially dynamic in the sense of being capable of acontinual self-updating of its contents. Each alphanumeric symbol ismodeled by employing the common-property concept in which analphanumeric symbol is identified by primitive elements and theirrelationships, as described in the Introduction Section. The exemplarsare determined empirically by conducting multiple experiments onmultiple users.

The relational features are derived in part from a set of primaryfeatures that describe the entire shape and orientation of the arcpoly.The states 84-to-94 represent the entire “signal-to-symbol” transition.The process 40 moves to state 96 to initialize the variables pertainingto all arcpolys and then moves to state 98 wherein allows states100-to-118 to be performed repeatedly, once for each alphanumeric. Thenumber of alphanumeric symbols, “arcnumc” was determined earlier by theprocess 92. The process 40 moves to state 100 to initialize variablesthat pertain to the recognition of each alphanumeric symbol.

Next, the process 40 moves to states 104 and then to state 106. In state104, the process 40 reduces the candidate alphanumeric symbols' searchrange by employing an evidence-based technique and using the informationstored in all four of the database modules, as depicted by states 90,94, 86, and 102. Thus, another embodiment of this invention is thereduction of candidate alphanumeric symbols. FIG. 58 describes thedatabases shown in states 90, 94, 86 and 102 by way of example. State102 incorporates generic and exemplar models of alphanumeric symbols, asopposed to states 90, 94 and 86 which provide information to support therecognition process via efficient collecting of intelligence which isboth pertinent and context dependent. As another preferred embodiment ofthe invention, there are multiple models for each hybrid category ofgeneric and exemplar models stored in the database. This information iscompiled by conducting multiple experiments on multiple users.

In state 106, as another preferred embodiment of the invention, theprocess 40 compiles a list of all such non-discarded list of candidatealphanumeric symbol(s), and computes their (its) secondary relationalfeatures described in connection with FIG. 42 which are used in part torecognize the alphanumeric symbol(s) via the derived alphanumericinferred confidence (or cost or dissimilarity) levels that serve todetermine how likely the hypothesized alphanumeric symbol identified iscomputed correctly. In state 106, alphanumeric cost (or dissimilarity)levels are generated that can determine how likely the hypothesizedalphanumeric symbol identified was achieved correctly, according to thepresently preferred embodiment of the invention. In state 106, theprocess 40 uses the information stored in all four of the databasemodules, as depicted by states 90, 94, 86, and 102. The process 40 movesto state 108 wherein the best candidate alphanumeric symbol isdetermined based on its confidence level and the number of matchedarcpolys, and then moves to state 110 to establish its validation,representing another preferred embodiment of the invention. This isachieved by a two step process (see FIG. 42 and FIG. 58):

1. thrsh=confdnce*nStruc2[Copt[a][idxc1]][idxc1];

-   -   Where, 10<confdnce<20, and ‘confdnce’ is empirically determined.

2. If: TscVL[a][idxc1]<=thrsh→validation is achieved.

-   -   Otherwise→validation fails.

Thereafter, the process 40 moves to the decision state 112. If adetermination is made in the decision state 112 that the chosenalphanumeric symbol is not confirmed, as another preferred embodiment ofthe invention, the process 40 moves to state 114 to initialize thereshaping module and then moves to state 116 to (i) determinealternative set(s) of reduced lists of alphanumeric candidate symbolsand their descriptors and secondary relational features as well as theirconfidence levels, (ii) for each incident, select the best alphanumericcandidate symbol and (iii) for each incident, validate the alphanumericcandidate symbol. Steps (i)-to-(iii) above are achieved by successivesymbolic transformation of pair(s) logical- and subclass-symbols to oneanother, or equivalently stated, reshaping of arcpoly(s). In state 116,the process 40 uses the information stored in all four of the databasemodules, as depicted by states 90, 94, 86, and 102.

Next, the process 40 moves to the decision state 118. In the decisionstate 112, if a determination is made that the chosen alphanumericsymbol is confirmed, the process 40 moves to the decision state 118. Ifthe result of the decision state 118 is in the affirmative, the process40 moves to state 98 to begin another cycle. Otherwise, the process 40terminates at an end state 120.

While the present invention has been described and shown in connectionwith specific embodiments thereof, it will be understood that it iscapable of further modification, and this application is capable offurther modification to recognize alphanumeric symbols which are eithercursive or printed and is capable of receiving digital information viaone of: a scanner, a memory, a storage device, a wireless communicationdevice.

High-Level Semantics Part I

The first of a three step process for the signal-to-symbol transition ispresented in this section. In step 1, as another preferred embodiment ofthe invention, for each polyline, a sequence of arcpoly(s) and theirsemantically high level descriptors are primarily computed by detectingrotation changes and segmenting the arcpoly(s) at the point whererotation change(s) occurred (if any) each time into two new arcpolys.Next, each new set of arcpolys is identified.

As another preferred embodiment of the invention, arcpoly(s) arehypothesized for further refinement by performing a criteria-based (i)region growing and (ii) split process for over-grown arcpoly(s) whicheither extend “significantly” beyond a half circle or may be comprisedof two or more stored arcpolys. As another preferred embodiment of theinvention, this process is followed by the derivation of spatialvariables. Arcpolys are mathematically described in the “Semantics”Section and are devised in a manner so that they conform as best aspossible to pre-stored pairs of logical-sub-class-symbols, shown in FIG.1.

FIG. 4 illustrates state 84 of FIG. 3. The process 84 begins at a startstate 140 and then moves to state 142 wherein an arcpoly or a series ofarcpolys are computed. The process 84 moves to state 144 to computespatial variables pertaining to each line of text and each polylineincluding the computation of text characteristic lines (i.e., base line,core line, ascender line, and descender line levels) for one or morelines of text within the image (see FIG. 39 for definitions). Baselineis an average line whereby the bottom of each alphanumeric symbol in theword rests, excluding any alphabet ascenders, descenders, or diacriticalmarks. The overall process 84 terminates at an end state 146.

FIG. 5 is a flow diagram illustrating process 142 shown as state 142 inFIG. 4. The process 142 begins at a start state 150 and moves to state152 wherein allows states 154-to-162 to be performed repeatedly, oncefor each polyline. The process 142 moves to state 154 wherein eachpolyline is reduced to one or a series of hypothesized arcpoly viaregion growing, the third phase of the symbolic reshaping scheme, asanother preferred embodiment of the invention (see FIG. 38 for anarcpoly's descriptor set and an example and FIG. 66 for an arcpoly'sfeature set definitions). The process 142 moves to state 156, followedby state 158 and then to state 160 wherein arcpolys' are revised using athree step post-processing process to split over-grown arcpoly(s) usingcriteria-based techniques, again the third phase of the symbolicreshaping scheme. The process 142 moves to the decision state 162. If adetermination is made at the decision state 162 that “p>=imgPolys−1”,then the process 142 terminates at an end state 164. Otherwise theprocess 142 moves to state 152 to begin the next cycle.

FIG. 6 illustrates process 154 shown as state 154 in FIG. 5. The process154 begins at a start state 170 and moves to state 172 to compute aseries of accurate low resolution element directions from a sequence ofadjoining pairs of X and Y points (see top portion of FIG. 2) wherebyeach direction is represented by one of eight equally divergent vectors.Accurate, because of the noise introduced by the digitizing apparatus,consecutive points may not be adjacent, thus according to theembodiments of the present invention a new technique is devised toachieve further precision by deriving the direction most accuratelyassociated with each of the two elements' relative location(s) withrespect to each another, as element(s) between the pair(s) of points maynot occur on any of the eight coded directions.

As another preferred embodiment of the invention, there are mappings andinverse mappings stored in the database from/to point location to/from amulti-resolution (8 or 16 resolution) directional value. Themulti-resolution directional values are graphically depicted in FIG. 2.Every such low resolution line direction has a value ranging between1-to-8 representing one of eight equally divergent vectors, asillustrated in top portion of FIG. 2. The process 154 then moves tostate 174 to preprocess the element directions computed in state 172.This is achieved by performing smoothing techniques whereby jitters dueto noise are removed, as another preferred embodiment of the invention.The process 154 moves to state 176 to compute polyline ‘line-based’representation, in contrast to the image polyline ‘point-based’representation. The process described above represents the core of theregion growing process described earlier. As the process 154 moves tostate 178, segmentation(s) may occur at derived line ID(s) to establisha unique clockwise motion in-between the computed segmentation points(see ‘arcpolys’ in the Semantics Section), thus producing an arcpoly ora series of inconsistent pairs of adjoining arcpolys, and determiningtheir descriptors (see FIG. 38 and FIG. 66). The process 154 terminatesat an end state 180.

FIG. 7 illustrates the process 172 to compute a low resolution elementdirection from a pair of point locations, described as state 172 in FIG.6. According to a preferred embodiment of the present invention the mostaccurate direction for adjacent as well as non-adjacent pairs of points(if any) is derived. The input to process 172 comprises two pairs ofpoints, namely (x1, y1) and (x2, y2). The process 172 begins at a startstate 190 and moves to state 192 wherein the difference between “x2” and“x1” is set to “delx”. The process 172 then moves to state 194 whereinthe difference between “y2” and “y1” is set to “dely”. The process 172moves to state 196 wherein “delxy[0]”, “delxy[1]” and “delxy[2]” aredetermined from the values of “delx” and “dely”. The process 172 movesto state 198 wherein “j” for “delxy[i]” is determined such that“delxy[i]” has the smallest value, for i=0, 1, and 2. The process 172then moves to the decision state 200, followed by the decision state 202provided that “j” is not equal to zero, and then to the decision state204 provided that “j=2”. Eventually, the process 172 moves to one ofeight states, namely states 222, 224, 226, 228, 230, 232, 234, or 236depending on the values of “j”, “x2−x1” and “y2−y1”, and establishes avalue for “dir”, namely the low resolution element direction which cantake 1-of-8 values. The process 172 terminates at an end state 238.

The process 174 is a flow diagram shown as state 174 in FIG. 6 thatdescribes in detail one of several cycles that collectively achievepolyline smoothing, as illustrated in FIG. 8. The input to the process174 comprises a sequence of low resolution element directions. Thenumber of cycles described above is empirically determined. The processbegins at a start state 250 and then moves to state 252 wherein allowsstates 254-to-272 to be performed repeatedly, once for each pair ofelements. The process 174 moves to state 254 wherein the modular 8difference between the last element's direction and its immediatepredecessor is set to “dif”. The process 174 then moves to the decisionstate 256, followed by the decision state 258 provided that the resultof the decision state 256 is not in the affirmative, and then to thedecision state 260 provided that “dif” is either −3, or 3 and finally tothe decision state 262 provided that the result of the decision state260 is not in the affirmative, as well. Next, process 174 moves to state264, 266, 268, or 270 depending on the affirmative response of decisionstates 256, 258, 260, and 262, respectively. The states 264, 266, 268,and 270 represent the type of smoothing that is selected for the givenelement directions' gradient, as shown in FIG. 36. The process 174 thenmoves to the decision state 272. If a determination is made at thedecision state 272 that states 254-to-272 were repeated for all adjacentpairs of elements, the process 174 moves to state 274 wherein a newsequence of X and Y points are generated from the revised series of lowresolution directions via a look-up table shown in FIG. 37. The process174 finally terminates at an end state 276. If the result of thedecision state 272 is in the affirmative, the process 174 moves to state252 to begin another cycle.

The process 176 achieves region growing by computing polyline line-basedrepresentation, as illustrated in FIG. 9. The process 176 begins at astart state 290 and moves to state 292 wherein the amount of adjoiningidentical element directions is determined for every element of thepolyline whose direction differs from its immediate predecessor(direction shift) or that it is the starting element of the polyline.Those skilled in the art recognize such a procedure. The process 176then moves to state 294 which is the first of a two step merger processto reduce the series of “X” and “Y” points computed above, belonging toa polyline ID, thereby establishing a specified distance between eachnewly computed consecutive points. During this process, each polyline'sstart point and end point are preserved. In state 294, a threshold isdetermined by assigning it to 1/n^(th) of the smaller of the twodifferences representing the row difference of the polyline ID's extremepoints and the column difference of the polyline ID's extreme points.Here, “n” is determined empirically (2<n<6). The process to compute thenumber of points skipped between each point and the next candidate pointbelonging to each polyline, uses a new “threshold” equaling to thelarger of the two values, namely the threshold derived empirically instate 294 and the number of consecutive identical element directionsassociated with the point as derived in state 294 to establish thedistance that determines the next point. Within this cyclic process,state 294 assigns the computed candidate point as its present point andcomputes the new “threshold” accordingly, and uses it to compute thenext candidate point, and finally terminates when this point matcheswith (or is at the proximity of) polyline ID's end point

Next, the process 176 moves to state 296 wherein two distinct series ofsaddle points, the first pertaining to the row aspect of points and thesecond to the column aspect of the points computed above. Each series ofsaddle points, comprises a sequence of local maxima and minima. Thoseskilled in the art recognize such a procedure. Next, median values ofthese two series are averaged together. A new “threshold” is derivedempirically from this new “average” using a pre-defined deterministicrule based on experiments performed on multiple users. Finally, if thepolyline ID is not the first polyline, this new “threshold” is refinedby averaging across all preceding polyline IDs' “thresholds”. Theprocess 176 then moves to state 298 wherein the second step to furtherreduce the series of X and Y points is achieved by using the new“threshold” described above to skip points, where appropriate, similarto the process described in state 294. Accordingly, the process 176derives “midDelX[p]” which represents a typical value for an arcpolylength. “midDelX[p]” is equal to the median value, up to polyline “p” ofthe median of the saddle points belonging to the column data.

The process 176 moves to state 300 to compute a series of highresolution accurate line directions from every pair of consecutivepoints belonging to polyline ID. Accurate, because consecutive pointsare not adjacent, thus a new technique is devised here to achievefurther precision by deriving a direction that is most accuratelyassociated with the each of the pair(s) of points' relative location(s),as line(s) between the pair(s) of points may not occur on any of thesixteen coded directions. Every high resolution line direction has avalue ranging between 1-to-16 representing one of sixteen equallydivergent vectors, as illustrated in bottom portion of FIG. 2.

The state 300 of process 176 is illustrated in FIG. 10. The input toprocess 300 comprises two pairs of points, namely (x1, y1) and (x2, y2).The process 300 begins at a start state 330 and moves to state 332wherein the difference between “x2” and “x1” is set to “delx”. Theprocess 300 then moves to state 334 wherein the difference between “y2”and “y1” is set to “dely”. The process 300 moves to state 336 wherein“delXY[0]”, “delXY[1]”, “delXY[2]”, “delXY[3]” and “delXY[4]” aredetermined. The process 300 moves to state 338 wherein “j” for“delXY[i]” is determined such that it has the smallest value, for i=0,1, 2, 3, and 4. Next, the process 300 moves to the decision state 340,and then to the decision state 362 provided that “j=1”, followed by thedecision state 380 provided that “j=3”, followed by the decision state398 provided that “j=2”, and finally to the decision state 408 providedthat “j=4”. The process 300 finally moves to one of sixteen states,namely states 352, 354, 356, 358, 372, 374, 376, 378, 390, 392, 394,396, 404, 406, 414, or 416 depending on the values of “j”, “x2=x1” and“y2−y1”, thus establishing a value for “dir”, the high resolution linedirection which can take 1-of-16 values. The process 300 terminates atan end state 360. The process 176 terminates at an end state 320.

Next, the process 142 moves to state 156 wherein each arcpoly isselectively refined in this first of a three step post-processingprocess. The process 156 operates on all successive arcpoly(s) to mergesuccessive arcpoly(s) when adjoining arcpolys have equal direction ofmotion and there is a minor direction change between the last linedirection of the former arcpoly and the first line direction of thelatter arcpoly such that the combined arcpoly has one direction ofmotion, as described in the Semantics Section. Moreover, the process 156performs other forms of post-processing using pre-defined deterministicrules that are based on such factors as successive arcpoly(s)′ clockwisemotions and extreme points' sizes, as well as modular 16 differencebetween the arcpoly(s)′ extreme points' directions. The rules wereestablished based on experiments performed on multiple users.

The state 158 of process 142 is illustrated in FIG. 5. The process 158is illustrated in FIG. 11 wherein selective arcpoly(s)' are structurally(i.e., shape, size, orientation, etc.) further refined using this secondstep of the post-processing process whereby over-grown arcpoly(s) may besplit into two adjacent arcpolys based on a pre-defined criteria inconnection with the detection of structural anomalies between themodeled alphanumeric symbols and the derived arcpoly(s), such as thedetection of significant “bends” within each arcpoly. The process 158represents the third phase of the symbolic reshaping scheme and beginsat a start state 430 and moves to state 432 wherein a line-basedpolyline is determined comprising a series of line points and linedirections. The process 158 then moves to state 434 wherein allowsstates 436-to-462 of the process 158 to be performed repeatedly, oncefor each arcpoly. The number of arcpolys and “numbdv16[p][k]” areestablished within the process 158. Next, the process 158 moves to state436 wherein primary features are computed for the hypothesized arcpolyID comprising: (i) extreme points' direction, (ii) depth direction,(iii) extreme points' size, (iv) depth size, and (v) clockwise motionrelative to the start point. Note that the fifth feature is mainly usedto derive other features and the sixth unlisted primary feature, namely,extension is inferred later during the overall process. As anotherpreferred embodiment of the invention, the six primary features arestored in the database for each arcpoly, describing the arcpoly's entireshape and orientation (or pose).

The process 158 then moves to the decision state 438. Next, the process158 moves to state 440 to detect segmentation typeI whereby significant“bends” in the handwritten input are detected and then moves to state444 to detect segmentation, contingent upon the affirmative response ofthe decision state 438 typeII whereby direction reversal is detected.The process 158 moves to the decision state 446. If the result of thedecision state 446 is in the affirmative the process 158 moves to state448 to detect segmentation typeIII whereby “significant” combined sizeand “small” direction shift of the first two lines of the arcpoly aredetected and then moves to the decision state 450. If the results of thedecision state 450 are in the affirmative the process 158 moves to state452 to detect segmentation typeIV whereby arcpoly's first or last line“significance” is detected, signifying the existence of a line arcpolyadjacent to an arc (i.e., “d”) arcpoly and then moves to the decisionstate 454 wherein condition IV is empirically determined fromexperiments performed on multiple users, as it depends on such factorsas arcpoly “k”'s (i) largest pair-wise modular 16 direction difference,(ii) median, (iii) maximum line size, and (iv) the number of lines.Otherwise, the process 158 moves directly to the decision state 454. Ifthe results of the decision state 454 are in the affirmative, theprocess 158 moves to state 456 to detect segmentation type V wherebyarcpoly's first line “significance” is detected solely, signifying theexistence of a line and arc/or line arcpoly and then moves to state 458.Otherwise, the process 158 moves directly to state 458. If the result ofthe decision state 438 is not in the affirmative, the process 158 movesto the decision state 454. If the result of the decision state 446 isnot in the affirmative, the process 158 moves to the decision state 454.

The states 440, 444, 448, 452, and 456 can serve to revise theoriginally hypothesized arcpoly “k” by identifying arcpoly “k”'s (i)segmentation line index, “bIndex” and (ii) computing the segmentationconfidence level, “probab”, both exclusive to their segmentation typeroutine. The process 158 moves to state 458 to detect the segmentationtype ID (i.e., segmentation type IV) that generates arcpoly “k”'ssmallest (or earliest) segmentation line ID while imposing a conditionwhereby segmentation confidence level generated by each segmentationtype must exceed 50. The process 158 then moves to state 460 to computethe primary features for the current (revised) arcpoly “k”. The process158 then moves to the decision state 462. If the result of the decisionstate 464 is not in the affirmative, the process 158 terminates at anend state 464. Otherwise, the process 158 moves to state 466 to computethe next arcpoly ID and its descriptors, as described earlier. Theprocess 158 then moves to state 468 wherein step 1 post-processing isperformed on the next arcpoly ID, as described earlier. Next, theprocess 158 moves to state 470 to update the line-based polyline anddescriptors described above by excluding the current arcpoly ID.Finally, the process 158 moves to state 434 to begin another next cycle.

The state 436 of process 158 is illustrated in FIG. 12. The process 436begins at a start state 480 and moves to state 482 wherein clockwisemotion of arcpoly “k” is determined by way of an example in FIG. 39. Theprocess 436 then moves to state 484 to compute extreme points' highresolution direction as described in the process 300. The process 436moves to state 486 wherein extreme points' size is computed. Next, theprocess 436 moves to state 488 to compute depth direction as shown inFIG. 39 and then moves to state 490 to compute depth size and finallyterminates at an end state 492.

The state 486 of the process 436 is illustrated in FIG. 13. The extremepoints' size derived using the following technique is considerably moreaccurate than its trivial counterpart of computing the distance from thetwo extreme points, because when these points somewhat converge towardseach other, their distance under-estimates the size of the arcpoly. Theprocess 486 begins at a start state 500 and moves to the decision state502. If a determination is made at the decision state 502 that“numbdv16[p][k]=1”, then line 0 size is set to the extreme points' sizeand then the process 486 terminates at an end state 506. Otherwise, theprocess 486 moves to state 508 wherein the extreme points' size isinitialized to zero. The process 486 then moves to state 510 wherein“idx” is incremented by one and then moves to state 512 to reviseextreme points' size. The process 486 moves to the decision state 514.If a determination is made at the decision state 514 that the polarityof the alignment level has changed from positive-to-negative or that“idxL=numbdv16[p][k]−1”, the process 486 terminates at the end state506. Otherwise, the process 486 moves to state 510 to begin anothercycle.

The aspect of state 512 of the process 486 that computes alignment levelbetween a pair of line directions is illustrated in FIG. 14. The process512 begins at a start state 520 and moves to state 522 wherein agradient direction is computed equal to the modular 16 differencebetween a pair of line directions. The process 512 then moves to state524 wherein “alpha” is initialized to 180. Next, the process 512 movesto the decision state 526. The process 512 moves to state 536 to assignzero to “alpha” contingent upon the affirmative response of state 526.The process 512 moves to the decision state 528. If the result of thedecision state 528 is in the affirmative, the process 512 moves to state538 to set “alpha” to 22.5 and then moves to state 546 to set“cos(alpha)” to the degree of alignment between the two directions.Otherwise, the process 512 moves to the decision state 530. If theresult of the decision state 530 is in the affirmative, the process 512moves to state 540 to set “alpha” to 45 and then moves to state 546.Otherwise, the process 512 moves to the decision state 532. If theresult of the decision state 532 is in the affirmative, the process 512moves to state 542 to set “alpha” to 67.5 and then moves to state 546.Otherwise, the process 512 moves to the decision state 534. If theresult of the decision state 534 is in the affirmative, the process 512moves to state 544 to set “alpha” to 90 and then moves to state 546. Theprocess 142 finally terminates at an end state 548.

The process to compute depth size is the same as the process to computeextreme points' size, with the following exceptions: (i) when arcpoly“k” comprises one line, then depth size is set to zero, (ii) thegradient direction is the modular 16 difference between depth directionand I^(th) line direction, where I=0, . . . , numbdv16[p][k]−1 and (iii)the cumulative process terminates when line ID's direction modularly(modular 16) exceeds depth direction.

The “establish direction exceed” aspect of “compute depth size”described in state 490 of FIG. 12 is denoted as state 490A and isillustrated in detail in FIG. 15. According to the FIG. 15, exceed isset to zero, if (i) arcpoly “k”'s motion is clockwise and the gradientdirection equivalent to the modular 16 difference between two directionsis greater than zero, or (ii) arcpoly “k”'s motion is counter clockwiseand the gradient direction is less than zero. However, exceed is set toone, if (i) arcpoly “k”'s motion is clockwise and the gradient directionis less than zero, (ii) arcpoly “k”'s motion is counter clockwise andthe gradient direction is greater than zero, or (iii) the gradientdirection is zero.

FIG. 16 illustrates the overall process to determine segmentation type Ibased on the identification of significant “bend(s)” in the handwritteninput, as illustrated in state 440 of FIG. 11. In summary, the process440:

1) focuses on all pairs of consecutive lines to determine (i) each ofthe two lines' size indicator, “m2” and “m4”, (ii) the two lines' “bend”strength indicator, “m1” and (iii) “m6” which is a function of “m1”,“m2”, and “m4”, and then

2) determines the type I segmentation (i) line segment index, “bIndex”that belongs to arcpoly “k”'s first line of the pair of lines,contingent upon coinciding with the maximum of all “m6” values computedduring the cycle(s) described in step (1), and (ii) confidence level,“probab”.

The process 440 is described in detail as follows:

The process 440 begins at a start state 578 and moves to state 580 toinitialize a subset of the variables used during process 440. Theprocess 440 moves to state 582 wherein allows states 584-to-638 to beperformed repeatedly, once for each number of lines of arcpoly “k” minusone. The process 440 moves to state 584 to initialize a subset of thevariables used during each cycle within the process 440. The process 440then moves to state 586 to compute clockwise-based and modular 16-basedpair-wise difference between line “a1” size and line “b1” size andassigns it to “dif”. The process 440 then moves to the decision state588. If the result of the decision step 588 is in affirmative and adetermination is made in the decision state 590 that b1+1<numbdv16[p][k]the process 440 moves to state 592 wherein line “b1” size is set to“lineSa” and “b1” is incremented by 1 and then the process 440 moves tothe decision state 594. If the result of the decision step 588 is not inaffirmative and a determination is made in state 590 thatb1+1<numbdv16[p][k] then the process 440 moves to state 596 to computeclockwise-based and modular 16-based pair-wise difference between line“b1” and line “b1+1” and assigns it to “dif”. If the result of thedecision state 594 is not in the affirmative, the process 440 moves tostate 602 to compute “m2” and “m4”. The process 440 then moves fromstate 596 to the decision state 598. If a determination is made at thedecision state 598 that “dif=−1 or 1” then the process 440 moves tostate 600 to set line “b1+1” size is set to “lineSb”. The process 440from state 598 provided that its result is not in the affirmative orfrom state 600 moves to state 602 to compute “m2” and “m4” empiricallyusing a pre-defined deterministic rule that is based on factors such asline “a1” size, “lineSa”, difference between polyline “p”'s top-most andbottom-most points, a preset “threshold”, line “b1” size and “lineSb.”Here, “m2” and “m4” are size indicators for line “a1” and line “b1”,respectively.

Thereafter, the process 440 moves to the decision state 604. If adetermination is made that “lineSa” is greater than zero, the process440 moves to state 606 to compute clockwise-based and modular 16-basedpair-wise difference between line “b1” and line “a1+1” and assigns it to“dif”, otherwise, the process 440 moves to state 608 to computeclockwise-based and modular 16-based pair-wise difference between line“b1” and line “a1” and assigns it to “dif”. Next, the process 440 movesfrom either state 606 or state 608 to state 610 to compute “m1”empirically based on such factors as “dif” and a preset “threshold”. Theprocess 440 then moves to the decision state 612. If a determination ismade at the decision state 612 that “m1=4 or 5”, the process 440 movesto the decision state 614, otherwise the process 440 moves to state 624.If result of the decision state 614 is not in the affirmative, theprocess 440 moves to state 624, otherwise the process 440 moves to state616 wherein “cntg” is incremented by one and then the process 440 movesto the decision state 618. If a determination is made that in state 618that “lineSa” exceeds zero, the process 440 moves to state 620, wherein“idxag[cntg]” is set to “a1+1”, otherwise the process 440 moves to state622, wherein “idxag[cntg]” is set to “a1”. From either of the states 620or 622, the process 440 moves to the decision state 624 to compute “m6”from “m1”, “m2”, “m4” and an empirically derived “fctrB”. The process440 then moves to the decision state 626. If a determination is madethat in the decision state 626 that Mmax<m6, then the process 440 movesto state 628 wherein the values of “m6”, “m1”, “m2”, “m4” and “idxag[0]”are assigned to “Mmax”, “m1x”, “m2x”, “m4x” and “idxagx”. The process440 then moves to the decision state 630. If a determination is madethat in the decision state 630 that “lineSa”>0, then the process 440moves to state 634 to assign “a1+1” to “idxax”, otherwise the process440 moves to state 632 to assign “a1” to “idxax” as well as to “idxa”.From either of the states 632 or 634, the process 440 moves to state 636wherein “b1” is assigned to “idxb” as well as to “idxbx”. Next, theprocess 440 moves to the decision state 638. If the result of thedecision state 626 is not in affirmative, then process 440 moves to thedecision state 638.

If the result of the decision state 638 is not in the affirmative, theprocess 440 moves to the decision state 640. If a determination is madethat in the decision state 640 that “m1x>4” then the process 440 movesto state 642 wherein “probab”, representing the segmentation confidencelevel, is set to 90. The process 440 then moves to the decision state650. If a determination is made at the decision state 650 that cntg>0then the process 440 moves to state 652 wherein “bIndex”, representingthe segmentation line index is set to “idxagx”, otherwise the process440 moves to state 654 wherein “bIndex” is set to “idxax”. From eitherof the states 652 or 654, the process 440 terminates at an end state660.

If the result of the decision state 640 is not in the affirmative, thenthe process 440 moves to the decision state 644. If the result of thedecision state 644 is not in the affirmative, then the process 440terminates at the end state 660. Otherwise, the process 440 moves to thedecision state 646. If the results of the decision state 646 are not inthe affirmative, the process 440 terminates at the end state 660.Otherwise, the process 440 moves to state 648 to compute “probab”empirically. The process 440 then moves to the decision state 650.

FIG. 17 illustrates the overall process to compute clockwise-based andmodular 16-based pair-wise difference between two directions asdescribed in states 586, 596, 606 and 608 of FIG. 16. This techniquedetermines the number of directions that needed to shift the firstdirection to the second in (i) a pre-specified clockwise motion and (ii)using the 16 direction codes. The process 586 begins at a start state670 and moves to the decision states 672. If the results of the decisionstate 672 are in the affirmative, the process 586 moves to state 678 toincrement “dif” by 16 and then terminates at an end state 684.Otherwise, the process 586 moves to the decision state 674. If theresults of the decision state 674 are in the affirmative, the process586 moves to state 680 to revise “dif” by setting it to “16−dif” andthen terminates at an end state 684. Otherwise, the process 586 moves tothe decision state 676. If the results of the decision state 676 are inthe affirmative, the process 586 moves to state 682 to revise “dif” bymultiplying it by −1 and then terminates at an end state 684. Otherwise,the process 586 moves to the end state 684.

The empirically derived process of state 648 shown in FIG. 16 isillustrated in detail in FIG. 18. The process 648 begins at a startstate 690 and moves to the decision state 692. If the outcome of thestate 692 is in the affirmative, the process 648 moves to state 694wherein “probab=90” and then terminates at an end state 742. Otherwise,the process 648 moves to the decision state 696. If the outcome of thestate 696 is in the affirmative, the process 648 moves to state 698wherein “probab=80” and then terminates at the end state 742. Otherwise,the process 648 moves to the decision state 700. If the outcome of thestate 700 is in the affirmative, the process 648 moves to the decisionstate 702. If the outcome of the state 702 is in the affirmative, theprocess 648 moves to state 708 wherein “probab=65” and then terminatesat the end state 742. Otherwise, the process 648 moves to the decisionstate 704. If the outcome of the state 704 is in the affirmative, theprocess 648 moves to state 708 wherein “probab”=65 and then terminatesat the end state 742. Otherwise, the process 648 moves to the decisionstate 706. If the outcome of the state 706 is in the affirmative, theprocess 648 moves to state 708 wherein “probab=65” and then terminatesat the end state 742.

Otherwise, the process 648 moves to the decision state 710. If theoutcome of the state 710 is in the affirmative, the process 648 moves tothe decision state 712. If the outcome of the state 712 is in theaffirmative, the process 648 moves to state 716 wherein “probab=55” andthen terminates at the end state 742. Otherwise, the process 648 movesto the decision state 714. If the outcome of the decision state 710 isnot in the affirmative, the process 648 moves to state 714. If theoutcome of the state 714 is in the affirmative, the process 648 moves tothe decision state 718. If the outcome of the state 718 is in theaffirmative, the process 648 moves to state 716 wherein “probab=55” andthen terminates at the end state 742. Otherwise, the process 648 movesto the decision state 720. If the outcome of the state 720 is in theaffirmative, the process 648 moves to state 716 wherein “probab=55” andthen terminates at the end state 742. Otherwise, the process 648 movesto the decision state 722. If the outcome of the state 722 is in theaffirmative, the process 648 moves to state 716 wherein “probab=55” andthen terminates at the end state 742.

Otherwise, the process 648 moves to the decision state 724. If theoutcome of the state 724 is in the affirmative, the process 648 moves tostate 740 wherein “probab=50” and then terminates at the end state 742.Otherwise, the process 648 moves to the decision state 726. If theoutcome of the state 726 is in the affirmative, the process 648 moves tostate 740 wherein “probab=50” and then terminates at the end state 742.Otherwise, the process 648 moves to the decision state 728. If theoutcome of the state 728 is in the affirmative, the process 648 moves tostate 734 wherein “probab=45” and then terminates at the end state 742.Otherwise, the process 648 moves to the decision state 730. If theoutcome of the state 730 is in the affirmative, the process 648 moves tostate 736 wherein “probab=20” and then terminates at the end state 742.Otherwise, the process 648 moves to state 738 wherein “probab=0” andterminates at the end state 742.

FIG. 19 illustrates the overall process to detect segmentation type IIbased on the identification of any pair of consecutive lines' withdirection reversal, as shown in state 444 of FIG. 11. The process 444begins at a start state 750 and moves to state 752 wherein allows states754-to-758 to be performed repeatedly, once for each pair of consecutivelines. The process 444 moves to state 754 to compute modular 16-basedpairwise difference between the lines. Next, the process 444 moves tothe decision state 756. If the result of the decision state 756 is inthe affirmative the process 444 moves to state 760 wherein thesegmentation line index is set to the second of the pair of lines with aconfidence level of 100 and then terminates at an end state 762.Otherwise, the process 444 moves to the decision state 758. If theresult of the decision state 758 is in the affirmative, the process 444moves to state 752 to begin another cycle. Otherwise, the process 444terminates at the end state 762.

FIG. 20 illustrates the overall process to detect segmentation type IIIbased on the identification of size “significance” for the combinedfirst two lines of arcpoly “k”, as shown in state 448 of FIG. 11. Theprocess 448 begins at a start state 770 and moves to state 772 tocompute modular 16-based pair difference between the first pair oflines, assign it to “dif”. The process 448 moves to the decision state774. If a determination is made at the decision state 774 that “dif !=−8and 8” and neither of the lines' depth sizes exceeds an empiricallyderived threshold thus indicating as having “low” depth sizes, then theprocess 448 moves to the decision state 776. If a determination is madeat state 776 that dif<2, then the process 448 moves to state 780 tocompute the combined line size “significance” indicator, “m”empirically, whereby “m” ranges from zero-to-six.

Next, the process 448 moves to state 782 to determine the segmentationconfidence level, “probab” from the value of “m”. The process 448 movesto state 784 wherein the segmentation line index, “bIndex” is set to avalue that indicates segmentation occurs at the end of the second line.The process 448 then terminates at an end state 786. If the results ofthe decision state 774 are not in the affirmative, the process 448 movesto the end state 786. If the results of the decision state 776 are notin the affirmative, the process 448 moves to the decision state 778. Ifa determination is made that “dir” described above is “semi-vertical” orequivalently “dir”=15, 16, 1, 7, 8, or 9 then the process 448 moves tostate 780. Otherwise, the process 448 moves to the end state 786.

FIG. 21 illustrates the overall process to detect segmentation type IVbased on the identification of size “significance” specifically for thefirst line or the last line of arcpoly “k”, as shown in state 452 ofFIG. 11. The process 452 begins at a start state 790 and moves to state792 that allows state 794 to be repeated for all adjacent pairs oflines. The process 452 then moves to the decision state 794. If adetermination is made that a reversal of direction for the pair of lineshas occurred, the process 452 terminates at an end state 810. Otherwise,the process 452 moves to the decision state 796. If a determination ismade that there is more pair(s) of lines, the process 452 then moves tostate 792 to begin another cycle. Otherwise, the process 452 moves tostate 798 wherein arcpoly “k”'s first line's size, “dis1”, extremepoints' size, “disr1” that excludes the first line's size, last line'ssize, “dis2” and extreme points' size, “disr2” that excludes the lastline's size are computed. Next, the process 452 moves to state 800 tocompute “m1” and “m2” empirically (based on the results of state 798).“m1” and “m2” take on values that range between 0-to-4 and representarcpoly “k”'s first and last line size “significance” indicators,respectively. The process 452 then moves to the decision state 802. Ifthe result of the decision state 802 is in the affirmative, the process452 moves to state 804 wherein specifies “bIndex” to indicatesegmentation occurs at the start point of the last line. Otherwise, theprocess 452 moves to state 806, wherein specifies “bIndex” to indicatesegmentation occurs at the end point of the first line. Next, theprocess 452 from either state 804 or state 806 moves to state 808 todetermine the segmentation confidence level, “probab” from theempirically derived value of “m1” or “m2”. Finally, the process 452terminates at the end state 810.

FIG. 22 illustrates the overall process to detect segmentation type Vbased on the identification of size “significance” for any line ofarcpoly “k”, as shown in state 456 of FIG. 11. The process 456 begins ata start state 820 and moves to state 822 wherein allows state 824 andstate 826, to compute line size “significance” indicator, “m”empirically, and the associated line index, “idx”, repeatedly for amaximum of all lines belonging to arcpoly “k”. The process 456 moves tothe decision state 826. If the result of the decision state 826 is inthe affirmative, the process 456 moves to state 822 to begin anothercycle. Otherwise, the process 456 moves to state 828 to compute thesegmentation confidence level, “probab” based on the value of “m”described above. The process 456 then moves to the decision state 830.If the result of the state 830 is in the affirmative, the process 456moves to state 832 wherein the segmentation line index, “bIndex” iscomputed based on the value of “idx”. Otherwise, the process 456terminates at an end state 834. From state 832, the process 456terminates at the end state 834.

FIG. 23 illustrates the overall process to detect post-processing III asshown in state 160 of FIG. 5. The process 160 represents the third phaseof the symbolic reshaping scheme, as it detects “over-extended” arcpolysfor segmentation such that each arcpoly's net gradient direction(s) doesnot exceed a pre-specified value determined empirically. The process 160begins at a start state 840 and moves to state 842 wherein allows states844-to-868 to be repeated for all arcpolys. The process 160 moves to thedecision state 844. If a determination is made in state 824 that “k” isgreater than zero, the process 160 moves to state 846 to compute thehypothesized arcpoly “k” as described above and then moves to state 848to perform post-processing I on arcpoly “k”, as described earlier.Otherwise, the process 842 moves directly to state 848. The process 160then moves from state 848 to state 850 to update the line-based polylineby excluding arcpoly “k” to generate a new sequence of line direction(s)and line extreme points. Next, the process 160 moves to state 852 tocompute arcpoly “k”'s primary features, as described earlier. Theprocess 160 moves to the decision state 854. If a determination is madein the decision state 854 that the number of lines of arcpoly “k”exceeds two, then the process 854 moves to the decision state 856. Ifthe result of the decision state 856 is in the affirmative, the process160 moves to the decision state 858. If a determination is made thatarcpoly “k” is not the last arcpoly of polyline “p” in the decisionstate 858, then the process 160 moves to state 862 wherein forwarddirection arcpoly “k” over-extension is established. Otherwise, theprocess 160 moves to state 860 wherein backward direction arcpoly “k”over-extension is established. In states 860 and 862 by using twodifferent methods, the segmentation line index, “idx” is determined foran over-extension that may have occurred.

In summary, this is achieved by the following five step process:

-   -   i) Compute mean and standard deviation, “std” of all lines        belonging to arcpoly “k”.    -   ii) Determine “m1” line index: From the start point of arcpoly        “k”, scan forward until either end point of arcpoly “k” is        detected or at the detection of the line index, “m1” whereby        “std” exceeds line “m1” size.    -   iii) Determine “m2” line index: From the end point of arcpoly        “k”, scan backward until either start point of arcpoly “k” is        detected or at the detection of a line index, “m2” whereby “std”        exceeds line “m2” size.    -   iv) Scan forward arcpoly “k”'s lines starting from the “m1” line        index, and scan backward arcpoly “k”'s lines starting from the        “m2” line index, and compute the cumulative change in line        directions.    -   v) If the net change in line directions exceeds (or equals to)        ten, over-extension has occurred and thus it makes this arcpoly        a viable candidate for segmentation at the computed line        indices, “m1” or/and “m2”.

The process 160 then moves to the decision state 864. If the result ofthe decision state 864 is in the affirmative, then the process 160 movesto state 866 wherein arcpoly “k” and arcpoly “k+1” are generated bysplitting the current arcpoly “k” at the segmentation line index, “idx”described above. The process 160 then moves to the decision state 868.If the result of the decision state 868 is in the affirmative, theprocess 160 moves to state 842 to begin another cycle. Otherwise, theprocess 160 terminates at an end state 870. If the result of thedecision state 864 is not in the affirmative, then the process 160 movesdirectly to state 868. If the result of the decision state 854 is in theaffirmative, then the process 160 moves to state 868. If the result ofthe decision state 856 is not in the affirmative, then the process 160moves to state 868.

FIG. 24 illustrates the overall process of state 860 of process 160,shown in FIG. 23. The process 860 begins at a start state 880 and movesto state 882 to set “e1” to the pre-specified line index, “m2” wherebythe backward scanning initiates, as described below. The process 860moves to state 884 wherein “e1=e1−1”. The process 860 then moves to thedecision state 886. If the result of the decision state 886 is in theaffirmative, the process 860 moves to state 888 to assign 16 to “delta”.Otherwise, the process 860 moves to state 890 to assign theclockwise-based and modular 16 based line “m2” direction minus line “e1”direction to “delta”. The process 860 then moves to the decision state892. If a determination is made in the decision state 892 that “delta”exceeds ten, then the process 860 moves to state 894 wherein “e1=e1+1”and then moves to the decision state 896. Otherwise, the process 860moves directly to the decision state 896. If the result of the decisionstate 896 is in the affirmative, the process 860 moves to state 884 tobegin another cycle. Otherwise, the process 860 terminates at an endstate 898.

FIG. 25 illustrates the overall process of state 862 of process 160,shown in FIG. 23. The process 862 begins at a start state 910 and movesto state 912 to set “e1” to the pre-specified line index, “m1” wherebythe forward scanning initiates, as described below. The process 862moves to state 914 wherein “e1=e1+1”. The process 862 then moves to thedecision state 916. If the result of the decision state 916 is in theaffirmative, the process 862 moves to state 918 to assign 16 to “delta”.Otherwise, the process 862 moves to state 920 to assign theclockwise-based and modular 16 based line “e1” direction minus line “m1”direction to “delta”. The process 862 then moves to the decision state922. If a determination is made in the decision state 892 that “delta”exceeds ten, the process 862 moves to state 924 wherein “e1=e1−1” andthen moves to the decision state 926. Otherwise, the process 862 movesdirectly to the decision state 926. If the result of the decision state926 is in the affirmative, the process 862 moves to state 914 to beginanother cycle. Otherwise, the process 862 terminates at an end state928.

The process 84 moves to state 144 wherein spatial variables arecomputed. FIG. 26 illustrates the overall process of the state 144 ofprocess 84, shown in FIG. 4. The process 144 begins at a start state 940and moves to state 942 to compute text line characteristics,representing another preferred embodiment of the invention (as definedearlier). The process 144 moves to state 944 wherein polyline-basedspatial variables and descending regions are computed such as“underLine[p]” (or descender line level), “baseLine[p]” (or baselinelevel), “midLine[p]” (or core line level), “topLine[p]” (or ascenderline level), as well as the descender marks, “gyjTypeq1[qc][j]”, wherej=0, . . . , gyjcnt[qc]−1 where “gyjcnt[qc]” refers to the number of thedescenders per text line, “qc”. Next, the process 144 moves to state 946wherein “elevated-bar” type polylines are detected, empirically (seeFIG. 41). Accordingly, a pre-defined deterministic rule is used based onthe following cues: (i) semi-horizontal extreme points' direction thatcan take on one of the following values: 3, 4, 5, 11, 12, 13 and (ii)the lowest point of the potential “elevated-bar” candidate polyline “p”to exceed an empirically derived threshold computed from the boundingbox corners of any of the neighboring polyline(s), namely, the“bar-holder”. Finally, the process 144 terminates at an end state 948.

FIG. 27 illustrates the overall process of state 942 of process 144,shown in FIG. 26. The process 942 begins at a start state 960 and movesto state 962 wherein allows states 964-to-1032 to be repeated for allpolylines. The process 942 moves to state 964 wherein a bounding box isobtained for polyline “q1” (see top portion of FIG. 40). The derivationof a bounding box is well known to those skilled in the art. The process942 moves to state 966 to initialize a subset of the text linecharacteristics variables. The process 942 then moves to the decisionstate 968. If a determination is made that in the decision state 968that “q1” is not equal zero, the process 942 moves to state 970 toassign the lower left-most point of the bounding box for polyline “q1”to “xscan1” and “yscan1”. This is achieved by setting (i) “yscan1” to“u1” minus a value derived empirically, during the previous cycle, forpolyline “q1−1”, and (ii) “xscan1” to “xmaxpt[q1−1]”. In (ii), “xscan1”is refined by decreasing it by “ts−l1” derived empirically when “xscan1”exceeds the column aspect of polyline “q1” and arcpoly “0”'s start pointor end point, and when ts−l1>threshold (“ts”, “u1”, “s1”, and “l1” werederived during the previous cycle for polyline “q1−1”), otherwise, ifts−l1<=threshold, then “xscan1” is decreased by “threshold”, where“threshold” is empirically determined.

Next, the process 942 moves to the decision state 972. If adetermination is made that in the decision state 972, an “elevated-bar”is detected (as described in connection with the mid-portion of FIG. 41)by establishing that its extreme points' direction is semi-horizontal,as well as establishing that either the vertical length of polyline“q1”'s bounding box is less than “factor1 multiplied by “ts−s1” or that(i) the right-most point of polyline “q1”'s bounding box is larger thanthe left-most point of polyline “q1−1”'s bounding box and (ii) theleft-most point of polyline “q1”'s bounding box is less than theright-most point of polyline “q1−1”'s bounding box, then the process 942moves to state 974 wherein polyline “q1” is designated as an“elevated-bar”. In the decision state 972, “factor1” is empiricallyderived. The process 942 moves to the decision state 976. If the resultsof the decision state 976 are in the affirmative, the process 942 movesto state 978 wherein “newLine=1” and then moves to state 1018.Otherwise, the process 942 moves to state 980 wherein “newLine=0” andthen moves to state 1018.

Next, if the result of the decision state 972 is not in the affirmative,then the process 942 moves to the decision state 982. If a determinationis made in the decision state 982 that the vertical length of polyline“q1−1”'s bounding box is less than “factor1”, described above,multiplied by “delta” determined in the previous cycle for polyline“q1−1”, then the process 942 moves to state 984 to decrease the value of“yscan1” by “delta” and assign the result to “mr”. Next, the process 942moves to the decision state 986. If the result of the decision state 982is not in the affirmative, the process 942 moves to the decision state986. If a determination is made in the decision state 986 that polyline“q1−1”'s right-most point exceeds polyline “q1”'s right-most point andpolyline “q1−1”'s left-most point is less than polyline “q1”'s left-mostpoint, then the process 942 moves to state 988 wherein “xscan1” is setto polyline “q1−1's left-most point and then moves to state 990 wherein“newLine=1”. If the results of the decision state 986 are not in theaffirmative, the process 942 moves directly to state 990.

Next, the process 942 moves to state 992 wherein allows state 994-to-996to be repeated for all scan values within the confines of the boundingbox, as shown in the top portion of FIG. 40. The process 942 moves tothe decision state 994. If a determination is made in the decision state994 that “xscan1” and “yscan1” matches any of the image points withinthe scan box's limit, the process 942 moves to state 998 to set “match”to one and then moves to state 1016. Otherwise, the process 942 moves tothe decision state 996. If the result of the decision state 996 is inthe affirmative, the process 942 moves to state 992 to begin anothercycle. Otherwise, the process 942 moves to the decision state 1000. If adetermination is made in the decision state 1000 that “match=0”, thenthe process 942 moves to state 1016. Otherwise, the process 942 moves tothe decision state 1002. If the results of the decision state 1002 arein the affirmative, the process 942 moves to state 1004 to reduce thevalue of “yscan1” by “ts−l1”. Next, the process 942 moves to states1006-to-1014, in a manner similar to states 992-to-1000. The process 942from state 1012 or 1014 moves to state 1016 wherein “newLine” is set tozero and then to state 1018 wherein text characteristic lines (i.e.,base line, core line, ascender line, descender line levels) as well as“typical” arc length are compute (see FIG. 39). If the results of thedecision state 1002 are not in the affirmative, the process 942 moves tostate 1018. If the result of the decision state 968 is in theaffirmative, the process 942 moves to state 1018.

Next, the process 942 moves to state 1020 to compute a single transition“layer” (i.e., the row associated with the core line level minus the rowassociated with the base line level, or the row associated with theascender line level minus the row associated with the core line level,etc.) from the mean value of all past “ts−l1”'s. Next, the process 942moves to the decision state 1022. If a determination is made in thedecision state 1022 that “newLine=1”, the process 944 moves to state1024 to record for polyline “q1”′ the following spatial variables: textcharacteristic lines, typical arc length, as well as the polyline “q1”s'that correspond to the start of each text line and end of each text line(see bottom portion of FIG. 39). Next, the process 944 moves to state1028 to update “l1”, “ts”, “s1”, “u1”, and “h1” by setting them tovalues derived in state 1018 and increments the number of text lines byone and then moves to the decision state 1032. If the result of thedecision state 1022 is not in the affirmative, the process 942 moves tostate 1026 to compute an average of the text characteristic lines andtypical arc length across all past polylines, and assign them to “l1”,“ts”, “s1”, “u1”, and “h1” respectively (see bottom portion of FIG. 39).Next, the process 942 moves to state 1030 wherein the updated values oftext characteristic lines and typical arc length are recorded forpolyline “q1”. The process 942 moves to the decision state 1032. If theresult of the decision state 1032 is in the affirmative, the process 942moves to state 962 to begin another cycle. Otherwise, the process 942terminates at an end state 1034.

The overall process of state 944 illustrated in FIG. 26 as process 144is described below as a 16 step detailed process, where “q1” signifiesthe polyline index and “qc” refers to the text line index:

Step 1: Compute “dthrsh” representing the average single transition“layer” for text line ID, “qc”.

Step 2: Set delxy to half of a typical arc length (or “midDelX[q1]”), asdescribed earlier, where “q1” is the polyline index.

Step 3: Determine a polyline representation of line points anddirections as described below:

-   -   x1[i], y1[i], where i=0, . . . , num where, ‘num’ refers to the        number of polyline “q1”'s lines

Step 4: Compute “saddle” points or local maxima and minima as describedbelow (see bottom of FIG. 41):

-   -   Category I: ymin[i1], where i1=0, . . . , cntn−1 Local Minima    -   Category II: ymax[i2], where i2=0, . . . , cntx−1 Local Maxima

Step 5: Modify “saddle” points by migrating elements from one categoryto another when a “significant” size change is detected between thiselement and the remaining elements of the category. Here, significanceis declared when:

-   -   1) the size change exceeds ⅕ of the average arc length        determined above, where 5 represents the number of lines that        make up a “typical arc”.    -   2) the cumulative size changes between this element and other        elements' within this category exceeds the cumulative size        change between this element and the largest element of the other        category.

Step 6: Rank the members of the two categories in an ascending order.

Step 7: nmajor=xmajor=0;

If: num>3 & (cntn+cntx)>3 & cntn>1 & cntx>1:

-   -   If:        (ymax[cntx−1]−ymax[0])>=(fctr9*dthrsh)∥(ymax[cntx−1]−ymax[0])>=(ymax[cntx−1]−ymin[0])/4:        -   xmajor=1;    -   If:        (ymin[cntn−1]−ymin[0])>=(fctr9*dthrsh)∥(ymin[cntn−1]−ymin[0])>=(ymax[cntx−1]−ymin[0])/4:    -   nmajor=1;

Where, 0.5<fctr9<1.0 and is empirically derived.

Step 8: qdel=0;

If: (q1−starts[qc])>0 & q1>1:

-   -   For: q=starts[qc], . . . , q1: qdel=qdel+qdelta[q]; (see Step        15)    -   qdel=(qdel/(q1−starts[qc]))*1.5;

Step 9: If: q1>starts[qc]:

-   -   Set variables ‘one’, ‘two’, ‘three’ and ‘four’ to the average of        at most 4 of the last polylines' text characteristic lines that        include, ‘underLine[q1]’, ‘baseLine[q1]’, ‘midLine[q1]’, and        ‘topLine[q1]’, respectively, contingent upon all belonging to        the same text line ID, “qc”.

Step 10: If: q1<=starts[qc] & num>3:

If: cntn>1:

-   -   If: difference between maximum and median values of category I        is less than fctr9*dthrsh OR if the following is satisfied:        ‘cntn>=6 & difference between maximum and median values of        category I is less than fctr10*dthrsh’:        -   baseLine[q1] is set to the median value of category I.    -   Else:        -   baseLine[q1] is set to category I's median and maximum value            average.    -   midLine[q1]=baseLine[q1]+(dthrsh,        SkyLoc[qc]−LandLoc[qc])_(maximum);    -   where, 1<fctr10<1.5 and is derived empirically derived.

If: cntx>1 & cntn=1:

-   -   midLine[q1] is set to the median value of category II.    -   baseLine[q1] is set to the lowest value of category I.    -   Note, ‘midLine[q1]’ will be slightly increased, by an        empirically derived value if its difference to ‘baseLine[q1] is        less than ‘dthrsh’.

If: cntn=cntx=1:

-   -   midLine[q1] is set to the highest value of category II.    -   baseLine[q1] is set to the lowest value of category I.    -   Note, ‘midLine[q1]’ will be slightly increased, by an        empirically derived value, if its difference to ‘baseLine[q1] is        less than ‘dthrsh’.

topLine[q1]=midLine[q1]+(midLine[q1]−baseLine[q1]);

underLine[q1]=baseLine[q1]−(midLine[q1]−baseLine[q1]);

Step 11: If: q1>starts[qc] & xmajor=1 & nmajor=1:

-   -   If: ‘three’ is closer in value to the highest value of category        II than to the ‘four’:        -   ‘midLine[q1]’ is set to the highest value of category II.        -   ‘baseLine[q1] is set to the lowest value of category II.        -   underLine[q1]=baseLine[q1]−dthrsh;        -   topLine[q1]=midLine[q1]+dthrsh;    -   Else:        -   ‘midLine[q1]’ is set to the lowest value of category II.        -   ‘topLine [q1] is set to the highest value of category II.        -   baseLine[q1]=midLine[q1]−dthrsh;            underLine[q1]=baseLine[q1]−dthrsh;

Step 12: If: q1<=starts[qc] & num<=3:

baseLine[q1]=LandLoc[qc];

midLine[q1]=SkyLoc[qc];

topLine[q1]=TallSize[qc];

underLine[q1]=UndrLndLoc[qc];

Step 13: If: q1>starts[qc] & num<=3:

baseLine[q1]=two;

midLine[q1]=three;

topLine[q1]=four;

underLine[q1]=one;

Step 14: If: q1>starts[qc] & num>3 & (nmajor=0∥xmajor=0):

dif2=dif5=10000;

dif1=‘two’ minus lowest value of category I.

If: cntn>1:

-   -   dif2=‘two’ minus highest value of category I.

dif4=‘three’ minus lowest value of category II.

If: cntx>1:

-   -   dif5=‘four’ minus lowest value of category II.

dif6=‘four’ minus highest value of category II.

If: ‘dif1’ or ‘dif2’ has the smallest value relative to ‘dif4’ & ‘dif5 &‘dif6”:

-   -   If: ‘dif1’ is smaller than ‘dif2’:        -   set ‘baseLine[q1]‘to the average of ’ two’ and the lowest            value of category I.    -   Else:        -   set ‘baseLine[q1]‘to the average of ’ two’ and the highest            value of category I.    -   difc=difd=10000;    -   difa=‘three’ minus lowest value of category II.    -   difb=‘four’ minus lowest value of category II.    -   If: cntx>1:        -   difc=‘three’ minus highest value of category II.    -   If: cntx>1:        -   difd=‘four’ minus highest value of category II.    -   alpha=beta=gama=delta=0;    -   If: ‘difa’ is smaller than ‘difb’, ‘difc’, and ‘difd’:        -   alpha=1;    -   If: ‘difb’ is smaller than ‘difa’, ‘difc’, and ‘difd’:        -   beta=1;    -   If: ‘difc’ is smaller than ‘difb’, ‘difa’, and ‘difd’:        -   gama=1;

If: ‘difd’ is smaller than ‘difb’, ‘difc’, and ‘difa’:

-   -   delta=1;

If: beta=1∥delta=1∥(beta=delta=0 & q1>1& (lowest value of category IIminus baseLine[q1])>=qdel)

-   -   If: beta=1:        -   topLine[q1] is set to the lowest value of category II.    -   If: delta=1:        -   topLine[q1] is set to the highest value of category II.    -   If: beta=0 & delta=0:        -   If: (topLine[q]−baseLine[q1]+epsilon1)<=(2*dthrsh) & q1>0:            -   topLine[q1]=baseLine[q1]+(2*dthrsh) epsilon2;    -   Else:        -   If: alpha=1:            -   midLine[q1] is set to the lowest value of category II.        -   If: gama=1:            -   midLine[q1] is set to highest value of category II.        -   If: alpha=1∥gama=1:            -   If: midLine[q]−baseLine[q1]+epsilon1<=dthrsh & q1>0:                -   midLine[q1]=baseLine[q1]+dthrsh−epsilon2/2;        -   If: alpha=1∥gama=1:            -   midLine[q1]=topLine[q1]−(topLine[q1]−baseLine[q1])/2;                -   underLine[q1]=baseLine[q1]−(midLine[q1]−baseLine[q1])/2;    -   If: ‘dif4’ or ‘dif5’ has the smallest value relative to ‘dif1’ &        ‘dif2 & ‘dif6’’:        -   If: ‘dif4’ is smaller than ‘dif5’:            -   set ‘midLine[q1]’ to the average of ‘three’ and the                lowest value of category II.        -   Else:            -   set ‘midLine[q1]’ to the average of ‘three’ and the                highest value of category II.        -   difa=‘two’ minus lowest value of category II.        -   dilfb=‘two’ minus highest value of category I.        -   difc=‘two’ minus median value of category I.        -   difd=‘one’ minus lowest value of category I.        -   alpha=beta=gama=delta=0;        -   If: ‘difa’ is smaller than ‘dilb’, ‘difc’, and ‘difd’:            -   alpha=1;        -   If: ‘difb’ is smaller than ‘difa’, ‘difc’, and ‘difd’:            -   beta=1;        -   If: ‘difc’ is smaller than ‘difb’, ‘difa’, and ‘difd’:            -   gama=1;        -   If: ‘difd’ is smaller than ‘difb’, ‘difc’, and ‘difa’:            -   delta=1;        -   If: alpha=1:            -   baseLine[q1] is set to the lowest value of category II.        -   If: beta=1:            -   baseLine[q1] is set to the highest value of category II.        -   If: alpha=1∥beta=1:            -   If: midLine[q]−baseLine[q1]+epsilon1<=dthrsh & q1>0:                -   baseLine[q1]=midLine[q1]−dthrsh−epsilon2/2;        -   If: gama=1:            -   underLine[q1] is set to the lowest value of category I.                -   If: alpha=1∥beta=1:            -   topline[q1]=midLine[q1]+(midLine[q1]−baseLine[q1]);            -   underLine[q1]=baseLine[q1]−(midLine[q1]−baseLine[q1]);        -   Else:            -   baseLine[q1] midLine[q1]−(midLine[q1]−underLine[q1])/2;            -   topLine[q1]=midLine[q1]+(midLine[q1]−baseLine[q1]);    -   If: ‘dif6’ has the smallest value relative to ‘dif1’, ‘dif2’,        ‘dif4’ & ‘dif5’:        -   Set ‘topLine[q1]‘to average of ’ four’ and the lowest value            of category II.        -   difa=‘three’ minus lowest value of category I.        -   difb=‘three’ minus highest value of category I.        -   dife=‘three’ minus median value of category I.        -   difc=‘two’ minus lowest value of category I.        -   difd=‘two’ minus highest value of category I.        -   diff=‘two’ minus median value of category I.        -   alpha=beta=beta2=gama=delta=delta2=0;        -   If: ‘difa’ is smaller than ‘difb’, ‘dife’, ‘difd’, ‘dife’,            and ‘diff’:            -   alpha=1;        -   If: ‘difb’ is smaller than ‘difa’, ‘dife’, ‘difd’, ‘dife’,            and ‘diff’:            -   beta=1;        -   If: ‘dife’ is smaller than ‘difb’, ‘difa, ‘difc’, ‘difd’,            and ‘diff’:            -   beta2=1;        -   If: ‘difc’ is smaller than ‘difa’, ‘difb’, ‘difd’, ‘dife’,            and ‘diff’:            -   gama=1;        -   If: ‘difd’ is smaller than ‘difa’, ‘difb, ‘difc’, ‘dife’,            and ‘diff’:            -   delta=1;        -   If: ‘diff’ is smaller than ‘difa’, ‘difb’, ‘difc’, ‘difd’,            and ‘dife’:            -   delta2=1;        -   If: alpha=1:            -   midLine[q1] is set to the lowest value of category I.        -   If: beta2=1:            -   midLine[q1] is set to the median value of category I.        -   If: beta=1:            -   midLine[q1] is set to the highest value of category I.        -   If: alpha=1∥beta2=1∥beta=1:            -   baseLine[q1]=midLine[q1]−(topLine[q1]−midLine[q1]);            -   underLine[q1]=baseLine[q1]−(midLine[q1]−baseLine[q1]);        -   If: (topLine[q]−midLine[q1]+epsilon1)<=dthrsh & q1>0:            -   midLine[q1]=topLine[q1]−dthrsh−epsilon2/2;        -   If: gama=1:            -   baseLine[q1] is set to the lowest value of category I.        -   If: delta=1:            -   baseLine[q1] is set to the highest value of category I.        -   If: delta2=1:            -   baseLine[q1] is set to the median value of category I.        -   If: gama=1∥delta=1∥delta2=1:            -   If: topLine[q]−baseLine[q1]+epsilon1<=2*dthrsh & q1>0:                -   topLine[q1]=baseLine[q1]+(2*dthrsh)−epsilon2;            -   midLine[q1]=topline[q1]−(topLine[q1]−baseLine[q1])/2;            -   underLine[q1]=baseLine[q1]−(midLine[q1]−baseLine[q1]);

Step 15: qdelta[q1]=topLine[q1]−midLine[q1];

-   -   If: lowest value of category I<underLine[q1] & lowest value of        category I+epsilon1>=underLine[q1]:        -   underLine[q1] is reduced by 10;        -   baseLine[q1]] is reduced by 10;

Step 16: If: num>1 & lowest value of category I<underLine[q1] &(baseLine[q1]−underLine[q1])>10:

gyjcnt[[qc] is incremented by 1.

gyjTypeql[qc][gyjcnt[[qc]−1]=q1;

Note that 2<epsilon1<8 and 0.5<epsilon2<4 are both derived empirically.

High-Level Semantics Part II

The second step of the three step process for the signal-to-symboltransition is presented in this section. In this step, as anotherpreferred embodiment of the invention, a feature set is computed wherebyfeatures are normalized and connection codes comprising one-of-nineintegers and “connection” separation are computed. Furthermore, eachalphanumeric ID is assigned to a specified series of polyline ID(s), asequence of arcpoly(s) and their semantically high-level descriptors, aslisted in FIG. 45. State 88 of the process 40 is illustrated in FIG. 3.

FIG. 28 illustrates the overall process 88 as it begins at a start state1040 and moves to state 1042 wherein the size of a typical arc,“midDelX[imgPolys−1]” is assigned to “deltaX”. The process 88 moves tostate 1044 wherein each polyline ID's vertical length representing thegradient associated with the highest and the lowest polyline ID's pointsare computed. The process 88 then moves to state 1046 to generate aseries of encodings pertaining to relationships amongst the neighboringpolyline IDs. Next, the process 88 moves to state 1048 to register (orgroup) polyline ID(s) and their arcpoly(s) to each alphanumeric ID andthen to normalize their size descriptors. The process 88 moves to state1050 to register (or group) to each alphanumeric ID, the encoding(s)pertaining to the relationships associated with the grouped polylineID(s) and their arcpoly(s) using the results of state 1046. Finally, theprocess 88 terminates at an end state 1052.

FIG. 29 illustrates the overall process of state 1046 shown in FIG. 28.The process 1046 begins at a start state 1060 and moves to state 1062wherein “thrsh=delX/5” is derived empirically. The process 1046 moves tostate 1064 wherein allows states 1066-to-1076 to be performedrepeatedly, once for each polyline. The process 1046 moves to state 1066wherein allows states 1068-to-1074 to be performed repeatedly, once foreach arcpoly. The process 1046 moves to state 1068 to encode polylineand arcpoly pair's mid point, “tplgy[p][k][1]” as ten, as shown in FIG.1 and then moves to state 1070 to compute extreme points' direction.Next, the process 1046 moves to state 1072 wherein polyline and arcpolypair's start point and end point are encoded as “tplgy[p][k][0]=0” and“tplgy[p][k][2]=20” for all extreme points' direction except those withvalues ranging between 8-to-15 whereby they are encoded as“tplgy[p][k][0]=20” and “tplgy[p][k][2]=0”. The process 1046 then movesto the decision state 1074. If the result of the decision state 1074 isin the affirmative, the process 1046 moves to state 1064 to beginanother cycle. Otherwise, the process 1046 moves to the decision state1076. If the result of the decision state 1076 is in the affirmative,the process 1046 moves to state 1066 to begin another cycle. Otherwise,the process 1046 moves to state 1078 for initialization. Next, theprocess 1046 moves to state 1080 wherein allows states 1082-to-1092 tobe performed repeatedly for all polylines. The process 1046 moves tostate 1082 wherein allows states 1084-to-1086 to be performed repeatedlyfor all arcpolys. The process 1046 moves to state 1084, wherein aconnection status (code) for each adjacent arcpoly (if any) pertainingto all the double pairs (in general, 1^(st) pair structure: polyline“p1”, arcploy “k1”; 2^(nd) pair structure: polyline “p2”, arcpoly “k2”)per first connection- and option-indices are computed, according to thelook-up table shown in FIG. 40.

As another preferred embodiment of the invention, there are mappings andinverse mappings stored in the database from/to a pair of topologicalcodes, each code belonging to a major point of one of two arcpolysto/from topological connection code. The process 1046 then moves to thedecision state 1086. If the result of the decision state 1086 is in theaffirmative, then the process 1046 moves to state 1080 to begin anothercycle. Otherwise, the process 1046 moves to the decision state 1088. Ifthe result of the decision state 1088 is in the affirmative, the process1046 moves to state 1090 to determine the connection status for thestart and end arcpoly(s) belonging to the same polyline “p” and thefirst connection and option, according to the look-up table shown inFIG. 40 and then moves to the decision state 1092. Otherwise, theprocess 1046 moves directly to the decision state 1092. If the result ofthe decision state 1092 is in the affirmative, the process 1046 moves tostate 1080 to begin another cycle. Otherwise, the process 1046 moves tostate 1094 wherein allows states 1096-to-1116 to be performed repeatedlyfor all double pairs described above, subject to the two polylines'indices not differing by larger than four, as derived empirically.

Next, the process 1046 moves to the decision state 1096. If adetermination is made in the decision state 1096 that the polylineindices are not equal, the process 1046 moves to the decision state1098. If a determination is made in the decision state 1098 thatfctr4*deltax<thrsh, then the process 1046 moves to state 1100 wherein“thrsh=fctr4*deltax” and then moves to the decision state 1104. “fctr4”is derived empirically using a predefined deterministic rule. Otherwise,the process 1046 moves to state 1102 to assign one half of polyline“i”'s vertical size determined from its highest and lowest points'gradient to “thrsh” and then moves to the decision state 1104. If theresult of the decision state 1096 is not in the affirmative, the process1046 moves to the decision state 1104. “thrsh” is derived empirically.

If the results of the decision state 1104 are in the affirmative, theprocess moves to state 1106 to compute the double pairs' first optionconnection code and separation”, incrementing the connection index byone for each of the results of the decision state 1104 which is in theaffirmative. Subsequently, state 1106 increments the option index andthen the process 1046 moves to the decision state 1108. If the resultsof the decision state 1104 are not in the affirmative, the process 1046moves directly to the decision state 1104. If the results of thedecision state 1108 are in the affirmative, the process 1046 moves tostate 1110 to compute the double pairs' present option's connection codeand separation”, incrementing the connection index by one for each ofthe results of the decision state 1108 which is in the affirmative.Subsequently, state 1110 increments the option index and then theprocess 1046 moves to the decision state 1112. If the results of thedecision state 1112 are in the affirmative, the process 1046 moves tostate 1114 to compute the double pairs' present option's connection codeand separation”, incrementing the connection index by one for each ofthe results of the decision state 1112 which is in the affirmative.Subsequently, state 1114 increments the option index and then theprocess 1046 moves to the decision state 1116. If the results of thedecision state 1112 are not in the affirmative, the process 1046 movesto the decision state 1116. If the results of the decision state 1116are in the affirmative, the process 1046 moves to state 1094 to beginanother cycle. Otherwise, the process 1046 terminates at an end state1118.

FIG. 30 illustrates the overall process of state 1070 shown in FIG. 29.The process 1070 is identical to the process 300 shown in FIG. 10,except that in states wherein “dir”s are computed they are followed by a20 step process to compute the direction gradient, “dir_gradient” asdescribed below. Subsequently, the value of “dir_gradient” will affect“dir” as described below in steps 21 and 22:

1) If: dir = 2 or 10 & delx > dely → dir_gradient = 1. 2) If: dir = 2 or10 & delx < dely → dir_gradient = −1. 3) If: dir = 6 or 14 & delx > dely→ dir_gradient = 1. 4) If: dir = 6 or 14 & delx < dely → dir_gradient =−1. 5) If: dir = 1 or 9 & delx > dely/2 → dir_gradient = 1. 6) If: dir =1 or 9 & delx > dely/2 → dir_gradient = −1. 7) If: dir = 7 or 15 & delx< dely/2 → dir_gradient = 1. 8) If: dir = 7 or 15 & delx > dely/2 →dir_gradient = −1. 9) If: dir = 8 & delx < 0 → dir_gradient = 1. 10) If:dir = 8 & delx > 0 → dir_gradient = −1. 11) If: dir = 16 & delx > 0 →dir_gradient = 1. 12) If: dir = 16 & delx < 0 → dir_gradient = −1. 13)If: dir = 3 or 11 & delx > 2 * dely → dir_gradient = 1. 14) If: dir = 3or 11 & delx < 2 * dely → dir_gradient = −1. 15) If: dir = 5 or 13 &delx < 2 * dely → dir_gradient = 1. 16) If: dir = 5 or 13 & delx > 2 *dely → dir_gradient = −1. 17) If: dir = 4 & dely < 0 → dir_gradient = 1.18) If: dir = 4 & dely > 0 → dir_gradient = −1. 19) If: dir = 12 &dely > 0 → dir_gradient = 1. 20) If: dir = 12 & dely < 0 → dir_gradient= −1. 21) If: dir_gradient = 1 → dir ++_(modular 16). 22) If:dir_gradient = −1 → dir −−_(modular 16).

The overall process of state 1048 illustrated in FIG. 28 as process 88is was a 14 step detailed process, wherein polyline(s), their arcpoly(s)and their (s) are grouped to each alphanumeric ID:

Step 1:—plstrt=a=0;

pnum[a]=1;

Step 2: For p1=0, . . . , imgPolys−1:

Step 3:—Set “amnt” to the smaller of the following: p1 strt+4 ORimgPolys−1

-   -   Compute p2s[j], where j=p1 strt, . . . , amnt−1

Step 4: For v=0, . . . , amnt−1:

Step 5: p2=p2s[v];

Step 6: For k1=0, . . . , kpoly[p1]−1:

Step 7: For k2=0, . . . , kpoly[p2]−1:

Step 8:—Establish the Boolean variable “near” for the double pair of

-   -   (as described below)

Determine “bar” & “cross” type polylines (see mid-portion of FIG. 41)

Step 9:—If near=1:

-   -   Assimilate “p2” index into “a” (provided it has not been        assimilated before, by using a list primarily devised to account        for the polyline indices that have been thus far designated as        belonging to “a”):    -   pnum[a]++;    -   lclToGlblPolys[a][pnum[a]−1]=p2;    -   Determine the next starting polyline index, “p1 strt”    -   Assimilate the features and descriptors shown in FIG. 45 for        polyline “p2” and all arcpoly(s) belonging to polyline “p2”.    -   Go to step 12.

Step 10:—If k2<kpoly[p]−1, go to step 7, otherwise go to step 11.

Step 11:—If k1<kpoly[p2]−1, go to step 6, otherwise go to step 12.

Step 12:—If v<amnt−1, got to step 4, otherwise go to step 13.

Step 13:—Set “p1” to “plstrt” and move to step 2 if p1<imgePolys−1,otherwise got to step 14.

Step 14:—Set “arcnumc” to “a+1” and normalize all size featuresbelonging to each arcpoly using process 1454 illustrated in FIG. 31.

The process to establish the Boolean variable “near” as described instep 8 above, whereby “near=1” signifies merger between the double pairstructures with indices, “p1”, “k1” and “p2”, “k2” is described below asa 16 step detailed process (see top portion of FIG. 41):

Step 1: thrsh=fctrE*midDelX[imgPolys−1]; where, 0<fctrE<1, derivedempirically.

Step 2: near=pnear=nprobII=sameLine=txbarmtch[p1]=txbarmtch[p2]0;

nprobIV=60;

dif1=dif2=dif3=dif4=dif5=dif6=dif7=dif8=dif9=1000;

Step 3: Establish whether “p1” and “p2” belong to the same text line,“idqc”, “sameLine=1”

Step 4: If sameLine=1, move to step 5, otherwise move to step 16.

Step 5: For u=0, . . . , tcnt[idqc] 1, determine whether (see topportion of FIG. 41):

-   -   tTypeq1[idqc][u]=p2 OR txHolderq1[idqc][p2]=p1→txbarmtch[p1]=1;    -   tTypeq1[idqc][u]=p1 OR txHolderq1[idqc][p1]=p2→txbarmtch[p2]=1;

Step 6: If txbarmtch[p1]=1 OR txbarmtch[p2]=1 extraNnProb[a]=5;

-   -   Move to step 16.

Else, move to step 7.

Step 7: Compute “pnear”, “nprobII” and “nprobIV” starting from step8-to-step 15.

Step 8: Compute “dif1[j]”, where j=1, . . . , 9, as illustrated in theportion of FIG. 41 by way of example, provided that each point belongingto the pair of points to compute “dif[j]” exceeds “underLine[pq]”, whereq=1 if the point belongs to “p1”, otherwise q=2.

Step 9: If dif1<=thrsh→pnear++;

-   -   If nprobIV<70 & (dif1<fctrE1*thrsh OR dif2<fctrE1*thrsh OR        dif3<fctrE1*thrsh)→nprobIV=70;    -   If nprobIV<80 & (dif1<fctrE2*thrsh OR dif2<fctrE2*thrsh OR        dif3<fctrE2*thrsh)→nprobIV=80;    -   If nprobIV<90 & (dif1<fctrE3*thrsh OR dif2<fctrE3*thrsh OR        dif3<fctrE3*thrsh)→nprobIV=90;

Else,

-   -   If nprobII<70 & (dif1<fctrE4*thrsh OR dif2<fctrE4*thrsh OR        dif3<fctrE4*thrsh)→nprobII=70;    -   If nprobII<60 & (dif1<fctrE5*thrsh OR dif2<fctrE5*thrsh OR        dif3<fctrE5*thrsh)→nprobII=60;    -   If nprobII<50 & (dif1<fctrE6*thrsh OR dif2<fctrE6*thrsh OR        dif3<fctrE6*thrsh)→nprobII=50;    -   If nprobII<40 & (dif1<fctrE7*thrsh OR dif2<fctrE7*thrsh OR        dif3<fctrE7*thrsh)→nprobII=40;

Where, 0<fctrE1<1, 0<fctrE2<1, 0<fctrE3<1 and

-   -   1<fctrE4<2, 1<fctrE5<2, 1<fctrE6<2, 1<fctrE7<2 and    -   fctrE1>fctrE2>fctrE3 and fctrE4<fctrE5<fctrE6<fctrE7.

Step 10: Repeat step 9, except replace “dif1”, “dif2”, and “dif3” by“dif4”, “dif5”, and “dif6”, respectively.

Step 11: Repeat step 9, except replace “dif1”, “dif2”, and “dif3” by“dif7”, “dif8”, and “dif9”, respectively.

Step 12: thrshy=baseLine[p2]+fctrF*(midLine[p2]−baseLine[p2]), where0<fctrF<1.

Step 13: If dif1<=fctrG*thrsh&ystrt[p2][k2]>=thrshy &ymid[p2][k2>=thrshy & yend[p2][k2]>=thrshy→pnear++;

-   -   If dif2<=fctrG*thrsh & ystrt[p2][k2]>=thrshy &        ymid[p2][k2]>=thrshy & yend[p2][k2]>=thrshy→pnear++;    -   If dif3<=fctrG*thrsh & ystrt[p2][k2]>=thrshy &        ymid[p2][k2]>=thrshy & yend[p2][k2]>=thrshy→pnear++;    -   Where, 0<fctrG<1.

Step 14: Repeat step 13, except replace “dif1”, “dif2”, and “dif3” by“dif4”, “dif5”, and “dif6”, respectively.

Step 15: Repeat step 13, except replace “dif1”, “dif2”, and “dif3” by“dif7”, “dif8”, and “dif9”, respectively.

Step 16: If pnear<2→If pnear=1 & nprobII<50→missNnProb[a]=50;

-   -   Else→missNnProb[a]=nprobII;

Else→If txbarmtch[p1]=txbarmtch[p2]=0 & pnear=3→extraNnProb[a]=2;

-   -   Else→extraNnProb[a]=100−nprobIV;

near=1;

Note, in the process described above to compute “near”, thresholds suchas “fctrE”, “fctrE1”, “fctrE2”, “fctrE3”, “fctrE4”, “fctrE5”, “fctrE6”,“fctrE7”, “fctrF” and “fctrG” are derived empirically.

At this stage of the handwriting recognition process, the derivation ofa highly accurate depth direction is critical, as a slight deviation ofa depth direction from its true value may adversely impact the accuracyof such a process, as it can later erroneously identify a logical symbolas the true logical symbol for an arcpoly. The aspect of step 9 of theprocess 1048 that “computes accurate depth direction”,“depdirc[a][p][k]” listed in FIG. 45 as part of the assimilation processfor polyline “p” and “arcpoly “k”, is described below as an eight stepprocess:

Step 1: Compute the mid-point location, “xml” and “yml” between theextreme points.

Step 2: Compute “bdryEs” representing half of the total size of alllines.

Step 3: Starting from the first line and proceeding incrementally,determine the line index subject to either esl1<=bdryEs<=esl2 oresl2>bdryes, where “esl1” refers to the cumulative line size up to thecurrent line index and “esl2” refers to the cumulative line size up tothe next line index.

Step 4: If: esl1<=bdryes<=esl2 or esl2>bdryEs:

-   -   idx=line index+1;    -   residue=bdryEs−esl1;

If: esl2>bdryEs:

-   -   idx=line index;    -   residue=bdryEs;

Step 5: residue=residue/line “idx”'s size

Step 6: If: idx>0:

-   -   1) Multiply the difference between the column aspect of the end        point of line “idx−1” and the column aspect of the end point of        line “idx” by “residue” and add the result to the column aspect        of the end point of line “idx−1” and then assign the result to        “xm2”.    -   2) Multiply the difference between the row aspect of the end        point of line “idx−1” and the row aspect of the end point of        line “idx” by “residue” and add it to the row aspect of the end        point of line “idx−1” and then assign the result to “ym2”    -   If: idx<=0:    -   1) Multiply the difference between the column aspect of the        first point of line 0 and the column aspect of the end point of        line “idx” by “residue” and add the result to the column aspect        of the first point of line 0 and then assign the result to        “xm2”.    -   2) Multiply the difference between the row aspect of the first        point of line 0 and the row aspect of the end point of line        “idx” by “residue” and add the result to the row aspect of the        first point of line 0 and then assign the result to “ym2”.

Step 7: Compute the high resolution direction, as described in theprocess 300.

Step 8: Set the high resolution direction computed in Step 7 to the next(nearest) even value direction and assign the result to“depdirc[a][p][k]”.

FIG. 31 illustrates the overall process of state 1454 described in step14 of the process 1048 to “normalize each arcpoly's feature valuespertaining to sizes”, as listed in FIG. 45. The process 1454 begins at astart state 1670 and moves to state 1672 wherein a threshold, namely“cthrsh” representing a height threshold to classify alphanumericsymbols into a class whose polyline “p” generally extend vertically upto, but not beyond “midLine[p]” and a class whose polyline “p” generallyextend vertically up to “topLine[p]”. The process 1454 moves to state1674 wherein allows states 1676-to-1688 to be repeated for allalphanumeric symbols, namely “arcnumc” derived earlier. The process 1454then moves to the decision state 1676. If the result of the decisionstate 1676 is in the affirmative, the process 1454 moves to state 1678to set “dvd[a]” to two. Otherwise, the process 1454 moves to state 1680to set “dvd[a]” to one.

Next, the process 1454 moves to state 1682 wherein the line sizefeatures of all arcpolys belonging the alphanumeric “a” are normalizedby multiplying them each by the factor, “20/(delY[a]*dvd[a])”. Theprocess 1454 moves to state 1684 to compute the extreme points' sizesfor all arcpolys belonging to the alphanumeric “a” as derived earlier.Next, the process 1454 moves to state 1686 to compute depth sizes forall arcpolys belonging to the alphanumeric “a” as described earlier. Theprocess 1682 moves to the decision 1688. If the result of the decisionstate 1688 is in the affirmative, the process 1454 moves to state 1674.Otherwise, the process 1454 terminates at an end state 1690.

FIG. 32 illustrates the overall process of state 1672 shown in FIG. 31.The process 1672 begins at a start state 1700 and moves to state 1702wherein the vertical distance between the highest point and lowest pointof each alphanumeric “a” is assigned to “del[a]”, where a=0, . . . ,arcnumc−1. The process 1672 moves to state 1704 to rank the elements ofthe “del” vector in an ascending order to generate the “rdel” vector.The process 1672 then moves to state 1706 wherein allows states1708-to-1716 to be repeated for all elements of the “rdel” vector. Theprocess 1672 moves to the decision state 1708. If a determination ismade in the decision state 1708 that the element index, “d” of the“rdel” vector exceeds zero and is less than the number of elements ofvector “rdel” minus one, then the process 1672 moves to state 1710wherein the net sum of all values of the elements of “rdel” with indicesless than or equal to the index associated with the median value of the“rdel” vector, “sum1[d]” is computed. The process 1672 moves to state1712 wherein the net sum of all values of the elements of “rdel” withindices larger than the index associated with the median value of the“rdel” vector, “sum2[d]” is computed. Next, process 1672 moves to state1714, wherein “sum[d]−absolute value (sum1[d]−sum2[d]). The process 1672moves to the decision state 1716. If the results of the decision state1708 are not in the affirmative, the process 1672 moves to the decisionstate 1716. If the result of the decision state 1716 is in theaffirmative, the process 1672 moves to state 1706 to begin anothercycle. Otherwise, the process 1672 moves to state 1718 to determine theindex of the “rdel” vector element, “idxm” that generates the smallestvalue for the “sum” vector. Next, the process 1672 moves to state 1720set “cthrsh=del[idxm]+(del[idxm+1]−del[idxm])/2”. Finally process 1672terminates at an end state 1722.

FIG. 33 illustrates the overall process of state 1050 shown in FIG. 28.The process 1050 begins at a start state 1740 and moves to state 1742wherein allows states 1744-to-1764 to be repeated for all double pairstructures, such as polyline “i”, arcpoly “n” and polyline “j”, arcpoly“k”. The process 1050 moves to the decision state 1744. If adetermination is made in the decision state 1744 that “ntpl[i][n][j][k]”exceeds zero, the process 1050 moves to the decision state 1746. If theresult of the decision state 1746 is in the affirmative, the process1050 moves to state 1748 to compute the number of connection codes peralphanumeric “a”, “ntplC[a]” from the accumulation of all“ntpl[i][n][j][k]”s subject to “i” and “j” belonging to “a”. Next, theprocess 1050 moves to state 1750 wherein allows states 1752-to-1762 tobe repeated for all “ntpl[i][n][j][k]”s and then moves to state 1752wherein “ntplCOpt[a][w1]” is updated. Here, w1=0, . . . , numw−1, where“numw” refers to the accumulation of all “ntplOpt[i][n][j][k]”s subjectto “i” and “j” belonging to “a”. The process 1050 moves to state 1754wherein allows states 1756-to-1760 to be repeated for all“ntplOpt[i][n][j][k]”s and then moves to state 1758 wherein four inversemappings from “w1”, and “v1” per “a” to (i) “i”, (ii) “n”, (iii) “j” and(iv) “k” are generated.

Next, the process 1050 moves to the decision state 1760. If the resultof the decision state 1760 is in the affirmative, the process 1050 movesto state 1754 to begin another cycle. Otherwise, the process 1050 movesto the decision state 1762. If the result of the decision state 1762 isin the affirmative, the process 1050 moves to state 1750 to beginanother cycle. Otherwise, the process 1050 moves to the decision state1764. If the results of the decision state 1764 are in the affirmative,the process 1050 moves to state 1742 to begin another cycle. Otherwise,the process 1050 terminates at an end state 1766. If the results of thedecision state 1744 or the decision state 1746 are not in theaffirmative, the process 1050 terminates at the end state 1766.

High-Level Semantics Part III

The final step of the three step process for the signal-to-symboltransition is presented in this section to compute logical symbols, aslisted in FIG. 54. As another preferred embodiment of the invention, aset of logical- and subclass-symbols are stored in the databasecomprising a finite class of arcpolys, as illustrated in FIG. 1, anddescribed as the process 3704 (except here, “invc[a]=0” and “optsubcc”and “optsubc” are set to −1). As another preferred embodiment of theinvention, arcpoly(s) of alphanumeric ID are automatically classifiedinto one or more pairs of logical- and subclass-symbols. The pair oflogical- and subclass-symbols are characterized by the set of primaryfeatures described above.

Here, the parameters passed include the following: (1) “ed” as extremepoints' direction, (2) “es” as extreme points' size, (3) “dd” as depthdirection, (4) “ds” as depth size, (5) “x1=xstrtc[a][p][k]”,“y1=ystrtc[a][p][k]”, “x2=xendc[a][p][k]”, and “y2=yendc[a][p][k].” Eachtime this process is invoked, a maximum of a single ‘logical symboloption’ and a pre-selected number of ‘sub-class symbols options’generating one logical symbol and at most generating a few subclasssymbols are computed.

This conservative approach limits the number of database alphanumericsymbols produced later during the handwriting recognition process, thusminimizing the occurrence of erroneously identified alphanumericsymbols. When at a later stage of the handwriting recognition process, asuitable database alphanumeric symbol is not identified then thisprocess (process 3704A) may be invoked again, until the desired resultis achieved. This process employs the first phase of the symbolicreshaping scheme, as another preferred embodiment of the invention. Thevariables computed during the process 3704A (see FIG. 54) for eachalphanumeric “a”, polyline “p” and arcpoly “k” are the following: (i)logical symbols, (ii) sub-class symbols and (iii) primary relationalfeatures, as listed in the Steps below, as they include (but not limitedto) variables with the indices, “[a][p][k]”. Note that “rota” shownbelow represents the additive bi-polar auxiliary rotation rangingbetween 0-to-4 units, described earlier. As another preferred embodimentof the invention, primary relational features are computed from thealphanumeric ID's feature set per arcpoly.

The process 3704A is described below using a detailed 26 step processthat includes the following major steps: compute (i) logical symbol,shown below as “subcc[a][p][k][optsubcc]” from extreme points' size andin certain situations from depth size per ‘logical symbol option,’ shownbelow as “numSubClassOpt[a][p][k]” or equivalently “optsubcc,” (ii)sub-class symbol per ‘sub-class symbols option’ shown below as“numSCopt[a][p][k]” or equivalently “optsubc,” (iii) arcpoly structuralvariance cost value, and (iv) ‘logical symbol and sub-class symbol(s)options’ discard criteria:

Step 1: Initialize a subset of variables for the final step of thesignal-to-symbol transition.

Step 2: optsubcc=strtsubcc=numSubClassOpt[a][p][k]−1;

optsubc=strtsubc=numSCopt[a][p][k]−1;

optsubcc++;

Step 3: dd8=dd;

-   -   If lineCntc[a][p][k]>1→Compute “dd” using the aspect of step 9        of the process 1048 described earlier that “computes accurate        depth direction”.

Step 4: If dd=dd8→samedir=1;

-   -   If motion_cw[a][p][k]=1→ed=(dd+4)_(Modular 16);    -   Else→ed=(dd−4)_(Modular 16);

Else→samedir=0;

Step 5: dd+=rota_(Modular 16);

ed+=rota_(Modular 16);

Step 6: If samedir=1 & ds<=thrsh_lineArc:

-   -   Compute “dirplus” using the process 300 to compute high        resolution direction.    -   If ds>0 & ‘dd’ is odd→If dirplus=1→dd++_(Modular 16);        -   If dirplus=−1→dd−−_(Modular 16);    -   If ‘ed’ is odd→If dirplus>=0→ed++_(Modular 16);        -   Else→ed=−−_(Modular 16);        -   scc_dirPlus=1;

Step 7: Compute number of unit rotations, “rt” from the values of “ed”,“edi”, “rota” and “dirplus”.

Step 8: scc_e=es−10;

scc_d=ds−10;

scc_x=ext;

min=10000;

scc_rotVL[a][p][k][optsubcc]=2*xsize*Sin(gama/2); (see FIG. 56)

Where, xsize=es;

-   -   gama=(rt*(360/16))/57.2957795;

Step 9: Compute “scclass”:

If ds<=thrsh_lineArc:

-   -   If ed=2 or 10→scclass=9;    -   If ed=4 or 12→scclass=10;    -   If ed=6 or 14→scclass=11;    -   If ed=8 or 16→scclass=12;    -   line=1;    -   scc_dptSizeVL[a][p][k][optsubcc]=ds;

Else:

-   -   scclass=dd/2;    -   line=0;    -   scc_dptSizeVL[a][p][k][optsubcc]=scc_d;

subcc[a][p][k][optsubcc]=scclass;

Step 10: If scc_rotVL[a][p][k][optsubcc]>0→rotaP[a][p][k][optsubcc]=1;

Else→rotaP[a][p][k][optsubcc]=0;

Step 11: For j=0, . . . , numSubc[scclass]−1:

Step 12: If line=1→del_d[j]=scc_dptSizeVL[a][p][k][optsubcc];

Else→If ds>20 & scd[scclass][j]=10→del_d[j]=10;

-   -   Else→del_d[j]=scc−sc_d[scclass][j];

Step 13: del_e[j]=scc_e−sc_e[scclass][j];

Step 14: If scc_x=sc_x[scclass][j]→del_x[j]=0;

-   -   Else→del_x[j]=5;    -   If scc_x=0 & sc_x[scclass][j]=4 OR scc_x=4 & sc_x[scclass][j]=0:    -   del_x[j]=10;

Step 15: dpthp[j]=eP[j]=1;

If del_e[j]<0→del_e[j]*=−1;

-   -   eP[j]=0;

If del_d[j]<0→del_d[j]*=−1;

-   -   dpthP[j]=0;

del_d[j]*=2;

Step 16: If del_e[j]−ExDelE<=lrgvar_e OR del_d[j]−ExDelD<=lrgvar_d OR

-   -   del_x[j]−ExDelX<=lrgvar_x→ndelta[j]=delta[j]=delta[j]+del_d{j]+del_x_[j];    -   Else→ndelta[j]=delta[j]=1000;

Step 17: If min>delta[j]→idx1=j;

-   -   min=delta[j];

Step 18: If j<numSubc[scclass]−1→move to step 11, otherwise move to step19.

Step 19: Repeat a process similar to steps 11, 17, and 18 to derive“idx2” representing the second smallest element of the “delta” vector.

Step 20: optsubc++;

delE[a][p][k][optsubc]=del_e[idx1];

delD[a][p][k][optsubc]=del_d[idx1];

delX[a][p][k][optsubc]=del_x[idx1];

subc[a][p][k][optsubc]=indx1[a][p][k][optsubc]=idx1;

endptP[a][p][k][optsubc]=eP[idx1];

depthP[a][p][k][optsubc]=dpthP[idx1];

If del_d[idx1]−ExDelD>10→delD[a][p][k][optsubc]+=delDPlus;

Where, “delDPlus” is derived empirically.

Step 21: optsubc++;

delE[a][p][k][optsubc]=del_e[idx2];

delD[a][p][k][optsubc]=del_d[idx2];

delX[a][p][k][optsubc]=del_x[idx2];

subc[a][p][k][optsubc]=indx2[a][p][k][optsubc]=idx2;

endptP[a][p][k][optsubc]=eP[idx2];

depthP[a][p][k][optsubc]=dpthP[idx2];

If del_d[idx2]−ExDelD>10→delD[a][p][k][optsubc]+=delDPlus;

Step 22: sc_VL[a][p][k][optsubc−1]=ndelta[idx];

-   -   sc_VL[a][p][k][optsubc]=ndelta[idx2];    -   If del_d[idx1]−ExDelD>10→sc_VL[a][p][k][optsubc−1]+=delDPlus;    -   If del_d[idx2]−ExDelD>10→sc_VL[a][p][k][optsubc]+=delDPlus;

Step 23: useless=0;

-   -   If sc_VL[a][p][k][optsubc−1]>=1000 &        sc_VL[a][p][k][optsubc]>=1000:        -   optsubcc−−;        -   optsubc−=2;        -   useless=1;

Step 24: If useless=0→Compute the following variables representing thenumber of remaining sub-class symbols per “scclass” and each of theremaining sub-class symbols (per “scclass”):

-   -   “numOsubcs[a][p][k][scclass]”    -   “othrSubcs[a][p][k][scclass][numOsubcs[a][p][k][scclass]−1]”

Step 25: Equivalently, if invc[a]=1→Compute:

-   -   “osnum[a][p][k][scclass]”    -   “othrSC2[a][p][k][scclass][osnum[a][p][k][scclass]−1]”

Step 26: numSubClassOpt[a][p][k]=optsubcc+1;

numSCopt[a][p][k]=optsubc+1;

As another preferred embodiment of the invention, the process 3704Adevised a set of variances comprising a set of arcpoly variance types, aset of counterpart dissimilarity values and a dissimilarity value perpair of arcpolys' relative location. Here, variances and dissimilaritiesstored in the database are structural and topological multi-typevariances and counterpart dissimilarity values comprising: (a) unitchange extreme points' size, (b) unit change depth size, (c) extra imagestructure size, (d) missing stored symbol size, (e) unit change singleextreme point position, (t) unit change single extreme point extension,and (g) unit rotation.

The process 3704A solely at this stage of the overall process torecognize alphanumeric symbols has initially set “level[a][p][k]” tozero, thus it is invoked twice, once for passing “thrsh_lineArc” as zeroand second as 1000, thus allowing both line and arc representations, andin both cases “rota=0”.

Candidates and Validation

As described in the preceding Sections, every polyline “p” and arcpoly“k” belonging to alphanumeric “a” generates “numSubClassOpt[a][p][k]”logical symbols and “numSCopt[a][p][k]” sub-class symbols. As anotherpreferred embodiment of the invention, the first of the series ofelimination of candidate alphanumeric symbols comprises discarding thosesymbols which do not match the structural and/or topolgical features ofthe alphanumeric ID.

According to the preferred embodiment of this invention, the currentknowledge-based system for handwriting recognition contains in itsdatabase a set of links from each pair of logical symbols and sub-classsymbols to their superset candidate alphanumeric symbol(s) (see FIG.58). Thus, according to the preferred embodiment of the invention, foreach of the polyline “p” and arcpoly “k”, a set of reduced list ofalphanumeric symbols may be generated by undergoing multiple series ofelimination of candidate alphanumeric symbols.

Moreover, the reduce list of candidate alphanumeric symbols is computedbased on the symbolic representation of the alphanumeric ID. It is thepremis of evidence-based strategy that the alphanumeric symbol(s) thatemerge(s) repeatedly (or commonly) for every polyline “p” and arcpoly“k” is (are) more likely to contain the correct alphanumeric symbol thansymbols that are not members of this list (see FIG. 43).

In addition, according to the preferred embodiment of this invention,the current knowledge-based system for handwriting recognition containsin its database a set of links from each encoding and separationpertaining to relationships to their superset alphanumeric candidatesymbols (see FIG. 58). Thus, for each “q1”, where q1=0, . . .ntplCOpt[a][q]−1 another set of alphanumeric symbols are produced foreach connection code, “q” where q=0, . . . , ntplC[a]−1 (see FIG. 44).

It is the premis of evidence-based strategy that the alphanumericsymbol(s) that emerge(s) repeatedly (or commonly) for every “q” is (are)more likely to contain the correct alphanumeric symbol than those thatdid not. By combining these two lists (or cross-referencing) toestablish the alphanumeric symbols which emerge in both lists, a shorterlist of alphanumeric candidate symbol(s) can be generated as viablealphanumeric symbol(s), whereby the list is more likely to contain thecorrect alphanumeric symbol than symbols that are not a member of thislist. In some cases, for either of the above invocations, or thecombined invocation, there may be no alphanumeric candidate symbolgenerated.

Due to intrinsic and extrinsic variations, the encodings do not alwaysreliably invoke the correct alphanumeric symbol. Consequently, thedetermination of the alphanumeric candidate symbols at times, mayexclude the list of alphanumeric candidate symbols generated byencodings, when the parameter “tplInvctn” is passed as a one, otherwise,when “tplInvctn” is passed as a zero, this list will be included togenerate the alphanumeric candidate symbols. For every alphanumeric “a”,initially “tplInvctn” is set to one, and in later attempts whenvalidation fails “tplInvctn” is set to zero to broaden the scope ofalphanumeric candidate symbols detection.

The process to establish alphanumeric candidate symbols is illustratedin (i) FIG. 43 to perform structural invocation, and (ii) FIG. 44 toperform invocations, by way of example. In FIG. 43, for each polyline“p” and arcpoly “k”, “numSubClassOpt[a][p][k]” logical symbols (q=0, . .. , numSubClassOpt[a][p][k]-1), in the horizontal direction, and“numSCopt[a][p][k]” sub-class symbols (q1=0, . . . ,numSCopt[a][p][k]-1), in the diagonal direction generate a 3-D set ofalphanumeric candidate symbols via “numscTOC[q][q1]” from the database(see FIG. 58) in the vertical direction. In FIG. 43, for illustrationpurposes only, the alphanumeric symbols in the diagonal direction arenot shown and although two boxes for each “numSubClassOpt[a][p][k]”logical symbol are shown for this direction to represent invokedalphanumeric candidate symbols, this would be true for most cases;however, in few cases, there may be only one box representing an invokedalphanumeric candidate symbol for each “numSubClassOpt[a][p][k]” logicalsymbol.

The technique to determine the alphanumeric candidate symbol(s) thatemerge(s) for every polyline “p” and arcpoly “k” belonging toalphanumeric “a” starts by searching for a mismatch between everyalphanumeric candidate symbol emerged for polyline 0 and arcpoly 0 andthe alphanumeric symbols emerged for the remaining polyline(s) andarcpoly(s) belonging to alphanumeric “a”. If a mismatch occurs theprocess moves to the next alphanumeric candidate symbol that emerges forthe polyline 0 and arcpoly 0 to search again to obtain a mismatch withthe other polylines(s) and arcpoly(s) of alphanumeric “a”'s candidatesymbols, as described above. Otherwise, a list is compiled that includesthe alphanumeric candidate symbol(s) that commonly occurs for allpolylines and arcpolys of alphanumeric “a”, as described below:

-   -   nsubccmnC→number of alphanumeric candidate symbols, derived        structurally.    -   cmnSubcC[j], where j=0, . . . , nsubccmnC−1→alphanumeric        candidate symbol, derived structurally.    -   sp1[j], where j=0, . . . , nsubccmnC−1→context of each        alphanumeric candidate symbol (i.e., cursive), derived        structurally.

In FIG. 44, for each encoding and separation pertaining torelationships, “q”, (q=0, . . . , ntplC[a]−1), “ntplCOpt[a][q]” options,in the horizontal direction generate a 2-D set of alphanumeric candidatesymbol(s) via “GtplToC[m][numtplToC[m]]”, where “m=Carctplgy[a][p][k]”from the database in the vertical direction. The technique to determinethe alphanumeric candidate symbol(s) that emerge(s) for every encodingand separation, “q”, is similarly derived as described above byestablishing commonality for a every alphanumeric candidate symbol thatemerges for “q=0” with alphanumeric symbols that emerge for theremaining “q”s, when “q>0”. During this process, a list is compiled thatincludes the alphanumeric candidate symbol(s) common to all “q”s (forq=0, . . . , ntplC[a]−1) belonging to alphanumeric “a”, as shown below:

-   -   ntplcmnC→number of alphanumeric candidate symbols, derived.    -   cmntplC[j], where j=0, . . . , ntplcmnC−1→alphanumeric candidate        symbol, derivedly.    -   sp2[j], where j=0, . . . , ntplcmnC−1→context of alphanumeric        candidate symbol (i.e., upper case), derived.

Note that during the comparisons made for establishing alphanumericsymbol commonality, context (i.e., upper case, lower case, cursive,etc.) of the alphanumeric symbols must match as well. During thecomparisons made in the case of encoding and separation to establishalphanumeric symbol commonality, the difference between the twoseparations corresponding to each of the alphanumeric symbols comparedmust not exceed “epsilon4” which has a small value and is derivedempirically.

When the two list described above are combined, a new list ofalphanumeric candidate symbols are invoked via the outlinedevidence-based strategy and complied as shown below:

-   -   numCmnC[a]→number of alphanumeric candidate symbols, derived.    -   cmnC[a][j], where j=0, . . . , numCmnC−1→alphanumeric candidate        symbol.    -   scrp[a][j], where j=0, . . . , numCmnC−1→context of alphanumeric        candidate symbol (i.e., upper case).

According to the example presented in FIG.'s H and I, the commonalphanumeric candidate symbol is “o”.

FIG. 3 shows state 106 of the process 40. FIG. 34 illustrates theoverall process 106 as it begins at a start state 2450 and moves tostate 2452 wherein variables pertaining to the post-invocation ofalphanumeric “a” candidate symbols are initialized. The process 106moves to state 2454 wherein allows states 2456-to-2466 to be repeatedfor i=0, . . . , numCmnC[a]−1 and then moves to the decision state 2456.Note that “noC” and “noCC” are initially set to ‘−1’. If the result ofthe decision state 2456 is in the affirmative, the process 106 moves tostate 2458 to compute the secondary relational features. Thus, asanother preferred embodiment of the invention, the symbolicrepresentation of the alphanumeric ID is computed (see FIG. 35 and FIG.42). Furthermore, the secondary relational features comprise topologicalvariance and alphanumeric dissimilarity value representing inferredconfidence level, as the alphanumeric ID is compared with a candidatealphanumeric symbol from the database. Next, the process 106 moves tothe decision state 2460. Otherwise, the process 106 moves to state 2462wherein 1000 is assigned to “TscVL[a][idxC[a][cmnC[a][i]]]” and thenmoves to state 2464 to shift back a single unit the post invocationrelational features starting from index “1”, in effect discarding thei^(th) post invocation relational features. The process 106 moves to thedecision state 2466. If the result of the decision state 2460 is not inthe affirmative, the process 106 moves directly to the decision state2466. If a determination is made in the decision state 2466 thati<numCmnC[a]−1, the process 106 moves to state 2454 to begin anothercycle. Otherwise, the process 106 moves to state 2468 whereby for i=0, .. . , numCmnC[a]−1 (i) the smallest and second smallest“TscVL[a][idxC[a][cmnC[a][i]]]”, namely “m1” and “m2” respectively arecomputed and (ii) set “sameVL” to one provided that there is (are) no“TscVL[a][idxC[a][cmnC[a][i]]]” repeat(s), otherwise set “sameVL” tozero. Finally the process terminates at an end state 2470.

FIG. 34 shows state 2458 of the process 106. FIG. 42 lists the resultingsecondary relational features of the process 2458 and FIG. 35illustrates the overall process 2458. This process employs the firstphase of the symbolic reshaping scheme. In summary, the process 2458performs the following tasks listed below for alphanumeric “a”, as ituses some of the variables pre-stored in the database (see FIG. 58) andas another preferred embodiment of the invention, it uses the derivedvariance types and levels shown in FIG. 56:

-   -   i) Capture for each arcpoly belonging to alphanumeric “a”, for        all logical symbol options and subclass symbols options, a        series of logical symbols, subclass symbols, associated logical        symbol option indices, and associated subclass symbol option        indices whereby any one of the alphanumeric symbols generated by        the arcpoly's structure-to-alphanumeric mappings pertaining to        the combined logical- and subclass-symbols matches with the        database's candidate alphanumeric symbol, as illustrated in        states 2542–2596.    -   ii) Determine redundant (or alternative) repeated pairs of        logical- and sub-class-symbols and establish alternating (or        toggle) block of the appropriate arcpoly”, as illustrated in        states 2670–2722.    -   iii) Capture for each database alphanumeric symbols        representation option, a series of logical- and subclass-symbols        pair(s) that result in a one-to-one match with the counterpart        database logical- and subclass-symbols pair(s) using forward and        in certain situations backward search technique, as illustrated        in states 2732–2798.    -   iv) Identify extra mismatched arcpoly(s) and derive cost values        for each extra arcpoly and the collective extra arcpoly(s), as        illustrated in states 2846–2864.    -   v) Identify missed database logical- and subclass-symbols        pair(s) and derive cost values for each missed arcpoly and the        collective missed logical- and subclass-symbols pair(s), as        illustrated in states 2870–2876.    -   vi) Derive a new arcpoly structural variance comprising cost        values for shape variance and rotation, as illustrated in states        2880–2886.    -   vii) Establish and implement a “discard criteria” for database's        candidate alphanumeric symbol option”, as illustrated in states        2888–2952.    -   viii) Compute connection codes' cost value pertaining to        relationships, as illustrated in state 2898.    -   ix) Compute secondary relational features per database's        candidate alphanumeric symbol option”, as illustrated in states        2918–2990.    -   x) Establish the best database option's “secondary relational        features”, as illustrated in states 2954–2990.

As another preferred embodiment of the invention, candidate alphanumericsymbols undergo the second series of elimination whereby candidatealphanumeric symbols are discarded whose selective feature valuesbelonging to the secondary relational feature set exceed presetcriteria-based thresholds (see step (vii). Moreover, the third of theseries of elimination of candidate alphanumeric symbols comprisesdiscarding candidate alphanumeric symbols whose topologicalseparation(s) exceed(s) a predefined value. The predefined values arederived empirically. Furthermore, normalized structural sizes of eachmodeled arcpoly associated with a pair of logical and subclass symbolsare stored in the database to allow the derivation of cost valuepertaining to missed arcpoly(s), as described in step (v).

The process 2458 begins at a start state 2540 and moves to state 2542wherein variables are initialized pertaining to the post-invocation ofalphanumeric “a” and its candidate symbols. The process 2458 moves tostate 2544 wherein allows states 2546-to-2592 to be repeated for p=0, .. . , pnum[a]−1 and then moves to state 2546 wherein allows states2548-to-2590 to be repeated for k=0, . . . , knum[a][p]−1. The process2458 moves to the decision state 2548. Note that “skipped pairs” referto “pr[j]”, “kr[j]”, where j=0, . . . , vnumr−1 and represent a set ofpolyline and arcpoly(s) that will not be considered as belonging toalphanumeric “a”, as “vnumr” is set to zero in this invention. If theresults of the decision state 2548 are in the affirmative, the process2458 moves to state 2550 to increment “kp” (initially set at −1) by one,initialize “cnk1[kp]” and “optcnt” to −1, and assign “p” and “k” to“pmap[a][kp]” and “kmap[a][kp]”, respectively. The process 2458 moves tostate 2552 wherein allows states 2554-to-2588 to be repeated for opt=0,. . . , numSubClassOpt[a][p][k]−1 and then moves to state 2554 toincrement “optcnt” by one and compute “sec”, “sc1”, “xsubc1[p][k][opt]”,“optmapa[kp][opt]”. The process 2458 moves to the decision state 2556.If the result of the decision state 2556 is in the affirmative, theprocess 2458 moves to state 2558 to set “opdif” to zero and then movesto the decision state 2562. Otherwise, the process 2458 moves to state2560 to set “opdif” to two and then moves to the decision state 2562. Ifa determination is made in the decision state 2562 that “opdif” exceedszero, the process 2458 moves state 2564 to increment “optcnt” by one andcompute “sc2”, “xsubc2[p][k][opt]”, and “optmapb[kp][opt]” and thenmoves to state 2568 to set “prcd” to one. Otherwise, the 2458 moves tostate 2566 to set “xsubc2[p][k][opt]” to one and then to move to state2568.

The process 2458 then moves to state 2570 wherein allows states2572-to-2574 to be repeated for v=0, . . . , numscToC[scc][sc1]−1. Theprocess 2458 moves to the decision state 2572. If the results of thedecision state 2572 are in the affirmative, the process 2572 moves tostate 2576 to set “prcd” to zero, increment “cntk1[kp]” by one, andcompute “subcc[kp][cntk1[kp]]”, “subc[kp][cntk1[kp]]”,“optmapV[kp][cntk1[kp]]”, “optmapW[kp][cntk1[kp]]” and then moves to thedecision state 2578. Otherwise, the process 2458 moves to the decisionstate 2574. If the result of the decision state 2574 is in theaffirmative, the process 2458 moves to state 2580 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2578. Ifa determination is made in the decision state 2578 that “opdif” exceedsone, the process 2458 moves to state 2580 wherein allows states2582-to-2584 to be repeated for v=0, . . . , numscToC[scc][sc2]−1.

The process 2458 moves to the decision state 2582. If the results of thedecision state 2582 are in the affirmative, the process 2458 moves tostate to 2586 to set “prcd” to zero, compute “subcc[kp][cntk1[kp]]”,“subc[kp][cntk1[kp]]”, “optmapV[kp][cntk1[kp]]”,“optmapW[kp][cntk1[kp]]” and increment “cntk1[kp]” by one, and thenmoves to the decision state 2588. Otherwise, the process 2458 moves tothe decision state 2584. If the result of the decision state 2584 is inthe affirmative, the process 2458 moves to state 2580 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2588. Ifthe result of the decision state 2578 not in the affirmative, theprocess 2458 moves to the decision state 2588. If the result of thedecision state 2588 is in the affirmative, the process 2458 moves tostate 2552 to begin another cycle. Otherwise, the process 2458 moves tothe decision state 2590. If the result of the decision state 2548 not inthe affirmative, the process 2458 moves to the decision state 2590. If adetermination is made in the decision state 2590 that k<knum[a][p]−1,the process 2458 moves to state 2546 to begin another cycle. Otherwise,the process 2458 moves to the decision state 2592. If the result of thedecision state 2592 is in the affirmative, the process 2458 moves tostate 2544 to begin another cycle. Otherwise, the process 2458 moves tostate 2594 to set “Nkplys[a]” and “km” to “kp+1” and then moves to state2596 to discard any possible repeats amongst the elements of the “subcc”and “subc” vectors.

Next, the process 2458 moves to state 2598 to initialize “qstrt” to zeroand then moves to state 2600 to initialize “kv” to zero and moves tostate 2602 wherein allows states 2604-to-2658 to be repeated forq=qstrt, . . . , numAlphaNumr−1. Note that “numAlphaNumr” refers to thenumber of modeled structural and alphanumeric symbols in the database.Then, the process 2458 moves to state 2604 wherein initialization occursand then moves to state 2606 wherein allows states 2608-to-2612 to berepeated for q1=0, . . . , dcnt. The process 2458 moves to the decisionstate 2608. If a determination is made in the decision state 2608 that“gmcnd[q1]” is equal to “q” the process 2458 moves to state 2610 to set“mtchq” to one and then moves to the decision state 2612. Otherwise, theprocess 2458 moves directly to the decision state 2612. If the result ofthe decision state 2612 is in the affirmative, the process 2458 moves tostate 2606 to begin another cycle. Otherwise, the process 2458 moves tothe decision state 2614. If a determination is made in the decisionstate 2614 that “mtchq” is equal to one, the process 2458 moves to state2616 to initialize “mtchp” to one and then moves to the decision state2618. If the result of the decision state 2618 is in the affirmative,the process 2458 moves to state 2620 to set “mtchp” to zero and thenmoves to the decision state 2622. Otherwise, the process 2458 movesdirectly to the decision state 2622. If a determination is made in thedecision state 2622 that “q” is greater than zero, the process 2458moves to state 2624 to revise the “Ccnd” and then moves to the decisionstate 2626. Otherwise, the process 2458 moves directly to the decisionstate 2626. Note that when the alphanumeric candidate symbol is cursive,their integer value is changed to distinguish them from theirnon-cursive counter-part when used for computing “idxC[a][Ccnd]” andthen changed back to their original values for other applications (i.e.,cursive “b”). If a determination is made in the decision state 2626 that“mtchp” is equal to one, the process 2458 moves to the decision state2628. If the result of the decision state 2614 or 2626 or 2628 is not inthe affirmative, the process 2458 moves to state 2638 to compute “idc2”.If the result of the decision state 2628 is in the affirmative, theprocess 2458 moves to state 2630 to revise “Ccnd” and set“idxC[a][Ccnd]” and “idxc1” to “q” and then moves to state 2632 toinitialize all elements of the “kpTokv2” vector per “idxC[a][Ccnd]” to−1.

Thereafter, the process 2458 moves to state 2634 to initialize“NmissSubcs[a][idxC[a][Ccnd]]”, “missInC[a][idxC[a][Ccnd]]”,“extrInC[a][idxC[a][Ccnd]]”, “TscVL[a][idxC[a][Ccnd]]”, and“NextrUnmtch[a][idxC[a][Ccnd]]” to zero and then moves to state 2636 toset “cntu” to one. The process 2458 moves to state 2638 to assign“idxC[a][Ccnd]” to “idxc2” and then to state 2640 to initialize “prcdn”to one. The process 2458 moves to the decision state 2642. If theresults of the decision state 2642 are in the affirmative, the process2458 moves to state 2644 to revise “Ccnd” and then moves to state 2646wherein allows states 2648-to-2652 to be repeated for h1=0, . . . ,NneverC. Otherwise, the process 2458 moves directly to state 2646. Theprocess 2458 moves to the decision state 2648. If the result of thedecision state 2648 is in the affirmative, the process 2458 moves tostate 2650 to set “prcdn” to zero and then moves to the decision state2652. Otherwise, the process 2458 moves directly to state 2652. If adetermination is made in the decision state 2652 that h1<NneverC, theprocess 2458 moves to state 2646 to begin another cycle. Otherwise, theprocess 2458 moves to the decision state 2654. If the results of thedecision state 2654 are in the affirmative, the process 2458 moves tostate 2660 to compute “qstrt” and then moves to the decision state 2664.Otherwise, the process 2458 moves to state 2656 to set “all” to one andthen moves to the decision state 2658. If a determination is made in thedecision state 2658 that q<numAlphaNumr−1, the process 2458 moves tostate 2602 to begin another cycle. Otherwise, the process 2458 moves tostate 2664 wherein allows states 2666-to-2940 to be repeated for op=0, .. . , numGSOpt][idxc1]−1, where “idxc1” is equal to “idxC[a][Ccnd]” andthen moves to state 2666 to initialize “mtch” to zero, “cnt” to −1, andthe vectors “option” and “hist” to −1 and then moves to the decisionstate 2668. “numGSOpt[idxc1]” refers to the number of database models(or representations) per database alphanumeric symbol identified byindex, “idxc1”. If the results of the decision state 2668 are in theaffirmative, the process 2458 moves to state 2670 wherein allows states2672-to-2702 to be repeated for i=0, . . . , kvNum2[idxc1][op]−1. Theprocess 2458 moves to state 2672 to initialize “mtchl” to zero andinitialize “kp” and “cnt” to −1.

Next, the process 2458 moves state 2674 wherein allows states2676-to-2696 to be repeated for q1=0, . . . , pnum[a]−1 and then movesto state 2676 wherein allows states 2678-to-2686 to be repeated forq2=0, . . . , knum[a][q1]−1. The process 2458 moves to state 2678 toincrement “kp” by one and then moves to state 2680 wherein allows states2682-to-2688 to be repeated for a2=0, . . . ,numSubClassOpt[a][q1][q2]−1. The process 2458 moves to the decisionstate 2682. If the result of the decision state 2682 is in theaffirmative, the process 2458 moves to the decision state 2688.Otherwise, the process 2458 moves to the decision state 2684. If theresult of the decision state 2684 is in the affirmative, the process2458 moves to state 2680 to begin another cycle. Otherwise, the process2458 moves to the decision state 2686. If the result of the decisionstate 2686 is in the affirmative, the process 2458 moves to state 2676to begin another cycle. Otherwise, the process 2458 moves to thedecision state 2696. If the result of the decision state 2688 is in theaffirmative, the process 2458 moves to state 2690 to set “mtch1” to one,increment “cnt” by one, and compute “kpCmn2[i][cnt]” and“optCmn2[i][cnt]” and then moves to the decision state 2692. Otherwise,the process 2458 moves to the decision state 2684. If a determination ismade in the decision state 2692 that “cnt>=1”, the process 2458 moves tostate 2694 to assign 1 to “mtch” and set “idx” to 1 and then moves tostate 2700 to compute “kpCmn[0]”, “optCmn[0]”, “kpCmn[1]”, and“optCmn[1]”. Otherwise, the process 2458 moves to the decision state2696. If the result of the decision state 2696 is in the affirmative,the process 2458 moves to state 2674 to begin another cycle. Otherwise,the process 2458 moves to the decision state 2698. If a determination ismade in the decision state 2698 that “mtch” is equal to one, the process2458 moves to state 2700 and then moves to state 2704 to increment“vtoggle2[idxc1][op]” by one. Otherwise, the process 2458 moves to thedecision state 2702. If the result of the decision state 2702 is in theaffirmative, the process 2458 moves to state 2670 to begin anothercycle. Otherwise, the process 2458 moves to state 2728.

Thereafter, from state 2704, the process 2458 moves to the decisionstate 2706. If a determination is made in the decision state 2706 that“vtoggle2[idxc1][op]” is even, the process 2458 moves to the decisionstate 2708. If a determination is made in the decision state 2708 that“vtoggle2[idxc1][op]” is equal to zero, the process 2458 moves to thedecision state 2710. If the result of the decision state 2710 is in theaffirmative, the process 2458 moves to state 2712 wherein“skipKp[idxc1][op]” is computed and “vchoice0[idxc1][op]” is set to one,and then moves to state 2728. Otherwise, the process 2458 moves to state2714 wherein “skipKp[idxc1][op]” is computed and “vchoice0[idxc1][op]”is set to zero, and then moves to state 2728. If the result of thedecision state 2708 is not in the affirmative, the process 2458 moves tothe decision state 2716. If the result of the decision state 2716 is inthe affirmative, the process 2458 moves to state 2718 to set“skipKp[idxc1][op]” to “kpCmn[0]” and then moves to state 2728.Otherwise, the process 2458 moves to state 2720 to set“skipKp[idxc1][op]” to “kpCmn[1]” and then moves to state 2728. If adetermination is made in the decision state 2706 that“vtoggle2[idxc1][op]” is odd, the process 2458 moves to the decisionstate 2722. If the result of the decision state 2722 is in theaffirmative, the process 2458 moves to state 2716 set“skipKp[idxc1][op]” to “kpCmn[1]” and then moves to state 2728.Otherwise, the process 2458 moves to state 2718 to set“skipKp[idxc1][op]” to “kpCmn[0]” and then moves to state 2728 whereinallows states 2730-to-2938 to be repeated for v1=0, 1.

Next, the process 2458 moves to state 2730 to assign zero to “vnum[op]”and then moves to state 2732 for initialization. The process 2458 movesto the decision state 2734. If a determination is made in the decisionstate 2734 that “v1” is equal to zero, the process 2458 moves to state2736 wherein allows states 2738-to-2764 to be repeated for q=0, . . . ,nStruc2[op][idxc1]−1 and then moves to state 2738 allows states2740-to-2762 to be repeated for kp=0, . . . , Nkplys[a]−1. The process2458 moves to the decision state 2740. If the result of the decisionstate 2740 is in the affirmative, the process 2458 moves to state 2742wherein “mtchq” is set to one and then moves to state 2744 to set“mtchsub” to zero. Otherwise, the process 2458 moves directly to state2744 and then moves to the decision state 2746. If a determination ismade in the decision state 2746 that “mtchq” is equal to zero, theprocess 2458 moves to state 2748 wherein allows states 2750-to-2752 tobe repeated for q2=0, . . . , cntk1[kp]−1, and then moves to thedecision state 2750, as described in FIG. 46. If the results of thedecision state 2750 are in the affirmative, the process 2458 moves tothe decision state 2754. Otherwise, the process 2458 moves to thedecision state 2752. If the results of the decision state 2754 are inthe affirmative, the process 2458 moves to state 2756 to set “mtchsub”to one, and compute “v1subcc”, v1subc”, “option[kp]”, and “option2[kp]”and then moves to the decision state 2758. Otherwise, the process 2458moves to the decision state 2752. If a determination is made in thedecision state 2752 that q2<cntk1[kp]−1, the process 2458 moves to state2748 to begin another cycle. Otherwise, the process 2458 moves to thedecision state 2758. If a determination is made in the decision state2758 that “mtchsub” is equal to one, the process 2458 moves to state2760 to increment “vnump[op]” by one and compute“opmapI[op][vnum[op]−1]”, “opmapII[op][vnum[op]−1]”,“pmap2[op][vnum[op]−1]”, “kmap2[op][vnum[op]−1]”,“v2subcc[op][vnum[op]−1]”, “vsubc[op][vnum[op]−1]”,“pair[op][vnum[op]−1]”, “k1[op][vnum[op]−1]”,“kptokv[op][vnum[op]−1][kp]”, “hist[vnum[op]−1]”, “option2[kp]” and thenmoves to the decision state 2764. Otherwise, the process 2458 moves tothe decision state 2762. If the result of the decision state 2762 is inthe affirmative, the process 2458 moves to state 2738 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2764. Ifthe result of the decision state 2764 is in the affirmative, the process2458 moves to state 2736 to begin another cycle. Otherwise, the process2458 moves to the decision state 2766. If the result of the decisionstate 2734 is not in the affirmative, the process 2458 moves to thedecision state 2766. Next, if a determination is made in the decisionstate 2766 that “v1” is equal to one, the process 2458 moves to state2770. The process 2458 then performs states 2772-to-2798 exactly asdescribed in states 2736-to-2764. Otherwise, the process 2458 moves todecision state 2800.

Next, if the result of the decision state 2800 is in the affirmative,the process 2458 moves to state 2802 wherein allows states 2804-to-2806to be repeated for qv=0, . . . , vnum[op]−1, and then moves to state2804 to assign “v2subcc[op][qv]” to “v4subcc[qv]” and “v2subc[op][qv]”to “v4subc[qv]”. The process 2458 moves to the decision state 2806. Ifthe result of the decision state 2806 is in the affirmative, the process2458 moves to state 2802 to begin another cycle. Otherwise, the process2458 moves to the decision state 2818. If the result of the decisionstate 2800 is not in the affirmative, the process 2458 moves to state2808 to initialize “sameperOp” to one and then moves to state 2810wherein allows states 2812-to-2816 to be repeated for qv=0, . . . ,vnum[op]−1. The process 2458 moves to the decision state 2812. If theresult of the decision state 2812 is in the affirmative, the process2458 moves state 2814 to set “sameperOp” to zero and then moves to thedecision state 2816. Otherwise, the process 2458 moves directly to thedecision state 2816. If the result of the decision state 2816 is in theaffirmative, the process 2458 moves to state 2810 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2818.

Next, if the result of the decision state 2818 is in the affirmative,the process 2458 moves to state 2820 to initialize all elements of the“kptokv2” vector to −1, set “Copt[a][idxc1]” and “vidxo” to “op”,“kvNum[a][idxc1]”, and “kv” to “vnum[vidxo] and then moves to state 2824wherein allows states 2826-to-2830 to be repeated for i=0, . . . , kv−1.The process 2458 moves to state 2826 wherein “vsubcc[a][idxc1][i]”,“vsubc[a][idxc1][i]”, “optmapI[a][idxc1][i]”, “optmapII[a][idxc1][i]”,“pmap44[a][idxc1][i]”, “kmap44[a][idxc1][i]”,“kpTokv2[a][idxc1][k1[vidxo][i]]” are computed. The process 2458 movesto state 2828 wherein “ccnd1” and “pairc[i]” are computed and then movesto the decision state 2830. If a determination is made in the decisionstate 2830 that i<kv−1, the process 2458 moves to state 2824 to beginanother cycle. Otherwise, the process 2458 moves to state 2832 to assignzero to “discrd” and set “km” to “Nkplys[a]” and “kv” to“kvNum[a][idxc1][i]”. The process 2458 then moves to the decision state2834. If the results of the decision state 2834 are in the affirmative,the process 2458 moves to state 2836 to assign one to “discrd”,increment “dcnt” by one and set “gmcnd[dcnt]” to “idxc1” and then movesto the decision state 2840. Otherwise, the process 2458 moves to thedecision state 2838. If the results of the decision state 2838 are inthe affirmative, the process 2458 moves to state 2836 and then moves tothe decision state 2840. Otherwise, the process 2458 moves directly tothe decision state 2840.

Next, if a determination is made in the decision state 2840 that“discrd” is equal to zero, the process 2458 moves to state 2842 toincrement “any” by one and then moves to state 2846 wherein allowsstates 2848-to-2856 to be repeated for p=0, . . . , pnum[a]-1 and thenmoves to state 2848 wherein allows states 2850-to-2854 to be repeatedfor k=0, . . . knum[a][p]−1. Then, the process 2458 moves to thedecision state 2850. If the result of the decision state 2850 is in theaffirmative, the process 2458 moves to state 2852 to compute “numz”,“extrUnmtch[a][idxc1][numz]”, “pextra2[numz]”, “kextra2[numz]”, andincrement “numz” and “NextrUnmtch[a][idxc1]” by one and then moves tothe decision state 2854. Otherwise, the process 2458 moves directly tothe decision state 2854. If the result of the decision state 2854 is inthe affirmative, the process 2458 moves to state 2848 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2856. Ifthe result of the decision state 2856 is in the affirmative, the process2458 moves to state 2846 to begin another cycle. Otherwise, the process2458 moves to state 2858 wherein allows states 2860-to-2864 to berepeated for w2=0, . . . , NextrUnmtch[a][idxc1]−1 and then moves tostate 2860 wherein “w7”, “idxa”, “pw2”, and “kw2” are computed. Theprocess 2458 moves to state 2862 to compute “extrInC[a][idxc1]”,“TscVL[a][idxc1]”, “extrInC1[a][idxc1]∥w7]”, “subcc2” and “subc2” andthen moves to the decision state 2864. If a determination is made in thedecision state 2864 that w2<NextrUnmtch[a][idxc1]−1, the process 2458moves to state 2858 to begin another cycle. Otherwise, the process 2458moves to state 2866 wherein “NextrUnmtch2[idxc1][op]” is set to“NextrUnmtch[a][idxc1]” and then moves to state 2870 wherein allowsstates 2872-to-2876 to be repeated for q=0, . . . ,nStruc2[vidxo][idxc1]−1 and then moves to the decision state 2872. Ifthe result of the decision state 2872 is in the affirmative, the process2458 moves to state 2874 to increment “NmissSubcs[a][idxc1] by one, andcompute “numz”, “missSubcs[a][idxc1][numz−1]”, “missInC1[a][idxc1][q]”(see FIG. 57), and “subcc2”, and to revise “missInC[a][idxc1]” and“TscVL[a][idxc1]”. The process 2458 moves to the decision state 2876. Ifthe result of the decision state 2876 is in the affirmative, the process2458 moves to state 2870 to begin another cycle. Otherwise, the process2458 moves to state 2878 wherein “NmissSubcs2[idxc1][op]” is set to“NmissSubcs[a][idxc1]” and then moves to state 2880 wherein allowsstates 2882-to-2886 to be repeated for kp=0, . . . , kv−1.

Thereafter, the process 2458 moves to state 2882 wherein “p”, “k”,“idxa”, and “idxc” are computed and then moves to state 2884 wherein“scRotVL[a][idxc1][kp]”, “rotVL[a][p][k]”, “scVL[a][idxc1]”, and“TscVL[a][idxc1]” are computed. The process 2458 moves to the decisionstate 2886. If the result of the decision state 2886 is in theaffirmative, the process 2458 moves to state 2880 to begin anothercycle. Otherwise, the process 2458 moves to state 2888 wherein“kvNum2[idxc1][op]” is set to “kvNum[a][idxc1]”. The process 2458 movesto state 2890 wherein allows states 2892-to-2894 to be repeated for z=0,. . . , kvNum[a][idxc1]−1 and then moves to state 2892 to compute“vsubcc[idxc1][op][z]” and “vsubc[idxc1][op][z]”. The process 2458 movesto the decision state 2894. If the result of the decision state is inthe affirmative, the process 2458 moves to state 2890 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2896. Ifthe result of the decision state 2896 is in the affirmative, the process2458 moves to state 2898 to compute “tplVL[a][idxc1]” and determine theBoolean value of “discard[any]”, and then moves to the decision state2900. Otherwise, the process 2458 moves directly to the decision state2900. If a determination is made in the decision state 2900 that“discard[any]” is equal to zero, the process 2458 moves to state 2902 toincrement “TscVL[a][idxc1]” by “tplVL[a][idxc1]” and then moves to thedecision state 2904. Otherwise, the process 2458 sets “TscVL[a][idxc1]”to 1000 and then moves to state 2910 to assign “TscVL[a][idxc1]” to“vminb[v1]”. If the result of the decision state 2904 is in theaffirmative, the process 2458 moves to state 2906 to assign one to“discard[any]” and then moves to state 2910. Otherwise, the process 2458moves directly to the decision state 2910. The process 2458 moves to thedecision state 2912. If the result of the decision state 2912 is in theaffirmative the process 2458 moves to state 2914 to decrement “any” byone and then moves to the decision state 2938. Otherwise, the process2458 moves to states 2916-to-2936 wherein variables pertaining to thesecondary relational features in FIG. 42 are re-assigned to similarvariables, except the indices, “[a][idxc1]” on the right side arereplaced by the “[any]” index on the left side. From state 2936, theprocess 2458 moves to the decision state 2938. If the result of thedecision state 2938 is in the affirmative, the process 2458 moves tostate 2728 to begin another cycle. Otherwise, the process 2458 moves tothe decision state 2940. If the result of the decision state 2940 is inthe affirmative, the process 2458 moves to state 2664 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2942. Ifthe result of the decision state 2942 is in the affirmative, the process2458 moves to state 2944 to assign one to “satisf” and then moves to thedecision state 2946. Otherwise, the process 2458 moves directly to thedecision state 2946. If the results of the decision state 2946 are inthe affirmative, the process 2458 moves to state 2600 to begin anothercycle. Otherwise, the process 2458 moves to state 2948 to increment“any” by one. The process 2458 moves to the decision state 2950. If theresult of the decision state 2950 is in the affirmative, the process2458 moves to state 2952 to set “discrd” to zero and then moves to state2954 wherein allows states 2956-to-2866 to be repeated for q=0, . . . ,any −1. Otherwise, the process 2458 moves directly to state 2954.

Next, the process 2458 moves to the decision state 2956. If adetermination is made in the decision state 2956 that “kvNumv[q]” is notequal to zero, the process 2458 moves to state 2960 to set “fctr” to“TscVLv[q]/kvNumv[q]” and then moves to the decision state 2962.Otherwise, the process 2458 moves to state 2958 to assign 10000 to“fctr” and then moves to the decision state 2962. If the result of thedecision state 2962 is in the affirmative, the process 2458 moves tostate 2964 to set “min” to “fctr” and “idxt” to “q” and then moves tothe decision state 2966. Otherwise, the process 2458 moves directly tothe decision state 2966. If the result of the decision state 2966 is inthe affirmative, the process 2458 moves to state 2954 to begin anothercycle. Otherwise, the process 2458 moves to the decision state 2968. Ifa determination is made in the decision state 2968 that “idxt” is equalto −1, the process 2458 terminates at an end state 2992. Otherwise, theprocess 2458 moves to states 2970-to-2990 wherein the reverse of theprocess described above from states 2916-to-2936 occurs, namely theindex, “[idxt]” on the right side is replaced by the “[a][idxc1]”indices on the left side. Finally, from state 2990, the process 2458terminates at an end state 2992.

As another preferred embodiment of the invention, FIG. 35 shows state2898 of the process 2458 to compute variation cost value (oralphanumeric dissimilarity value) for alphanumeric “a”. FIG. 59illustrates the overall process 2898 as it uses some of the variablespre-stored in the database (see FIG. 58 and FIG. 56). Moreover, a set ofvariances comprising a set of arcpoly variance types, a set ofcounterpart dissimilarity values and a topological dissimilarity valueper pair of arcpolys' relative location are stored in the database. Theprocess 2898 includes the following major steps:

-   -   i) Derive threshold value by:        -   determining connection code, and        -   determining the x- and y-coordinate(s) of the major point(s)            on each arcpoly belonging to the alphanumeric “a” used for            the computation of variation cost value, by:            -   revising the original logical symbol with the ‘logical                symbol option’ index of zero,            -   revising the original logical symbol with the first                ‘logical symbol option’ and the associated database                logical- and subclass-symbols pair, and            -   computing extreme point's code.    -   ii) Select appropriate pair(s) of arcpolys belonging to        alphanumeric “a” that directly takes part in the variation cost        value computation.    -   iii) Establish a one-to-one correspondence between the pair(s)        of arcpoly(s) and database logical- and subclass-symbols pair(s)        belonging to the database alphanumeric candidate symbol.    -   iv) Compute variation cost value for each of the pair(s) of        arcpoly(s) and database logical- and subclass-symbols pair(s).    -   v) Compute variation cost value for each of the mismatched        pair(s) of arcpoly(s) and database logical- and subclass-symbols        pair(s).    -   vi) Integrate the said variation cost values that includes the        topological cost value to generate the total alphanumeric        variation cost.

The process 2898 begins at a start state 2994 and moves to state 2996wherein a subset of the variables pertaining to the computation of“tplVL[a][idxc1]” are initialized. The process 2898 moves to thedecision state 2998. If a determination is made in the decision state2998 that “Ccnd” is equal to “o”, “O”, “0”, “Q”, or “a”, the process2898 moves to state 3000 to set “circle” to one, and then moves to state3002 to compute threshold variables, “tfctr”, “vfctr[idxc1]”,“vtplThrsh”, and set “idxo” to “Copt[a][idxc1]”. Otherwise, the process2898 moves directly to state 3002. The process 2898 moves to state 3004to initialize “tplVL[a][idxc1]”, and the vectors “midPrb” and “missVL”to zero. The process 2898 moves to state 3006 wherein allows states3008-to-3012 to be repeated for all arcpoly(s) belonging to alphanumeric“a” and then moves to the decision state 3008. If the result of thedecision state 3008 is in the affirmative, the process 2898 moves tostate 3010 to set “midPrb” pertaining to the appropriate polyline andarcpoly to one and then moves to decision state 3012. If the result ofthe decision state 3012 is in the affirmative, the process 2898 movesdirectly to state 3006 to begin another cycle. Otherwise, the process2898 moves to state 3014 to compute the lowest point, “ybot” of allpolyline(s) and arcpoly(s) belonging to alphanumeric “a”. The process2898 moves to state 3016 to assign “vtplThrsh” to “topolThrsh[a][idxc1]”and then moves to state 3018 wherein allows states 3020-to-3028 to berepeated for j=0, . . . , Ntplgy[idxc1][idxo]−1. The process 2898 movesto the decision state 3020. If the result of the decision state 3020 isin the affirmative, the process 2898 moves to state 3022 to increment“gcnt” by one and compute “gtpl[gcnt]” and then moves to the decisionstate 3024. Otherwise, the process 2898 moves to the decision state3028. If a determination is made in the decision state 3024 that“gtpl[gcnt]” matches with ‘4’, ‘3’, ‘5’, or ‘7’, the process 2898 movesto state 3026 to assign one to “midcon” and then moves to the decisionstate 3028. Otherwise, the process 2898 moves directly to the decisionstate 3028. If the result of the decision state 3028 is in theaffirmative, the process 2898 moves to state 3018 to begin anothercycle. Otherwise, the process 2898 moves to state 3030 to increment“gcnt” by one and then moves to the decision state 3032. If adetermination is made in the decision state 3032 that “pnum[a]” exceedsone, the process 2898 moves to the decision state 3034. If adetermination is made in the decision state 3034 that “midcon” is equalto zero, the process 2898 moves to state 3036 to revise “vtplThrsh” andthen moves to state 3040 to further revise “vtplThrsh” and set“topolThrsh[a][idxc1]” to “vtplThrsh”. Otherwise, the process 2898 movesto state 3038 to revise “vtplThrsh” and then moves to state 3040. If theresult of the decision state 3032 is not in the affirmative, the process2898 moves to state 3040. The process 2898 moves to the decision state3042. If a determination is made in the decision state 3042 that thenumber of connection codes pre-stored in the database per “idxc1” and“idxo” exceeds zero, the process 2898 moves to state 3044 to initialize“mtchq” to zero and compute “tp1”, “subcc[0]”, and “subc[0]” and thenmoves to state 3046 wherein allows states 3048-to-3052 to be repeatedfor kq=0, . . . , kv−1. Then, the process 2898 moves to the decisionstate 3048. If the result of the decision state 3048 is not in theaffirmative, the process 2898 moves to state 3046 to begin anothercycle. Otherwise, the process 2898 moves to state 3052 to assign one to“mtchq” and set “kp[0]” to “kq” and then moves to state 3054 to compute“tp1”, “subcc[1]” and “subc[1]”.

Thereafter, the process 2898 moves to state 3056 wherein allows states3058-to-3062 to be repeated for kq=0, . . . , kv−1 and then moves to thedecision state 3058. If the result of the decision state 3058 is in theaffirmative, the process 2898 moves to state 3060 to assign one to“mtchq” and set “kp[1]” to “kq” and then moves to state 3068 to compute“discrd” and revise “tplVL[a][idxc1]” and then moves to state 3078wherein “idxk” is set to one. Otherwise, the process 2898 moves to thedecision state 3062. If a determination is made in the decision state3062 that kq<kv−1, the process 2898 moves to state 3056 to begin anothercycle. Otherwise, the process 2898 moves to the decision state 3064. Ifa determination is made in the decision state 3064 that “mtchq” is equalto zero, the process 2898 moves to state 3066 wherein “tplVL[a][idxc1]”is incremented by 10, “missCnt” is incremented by one, and “missVL[tp1]”is set to 10, and then moves to the decision state 3070. If adetermination is made in the decision state 3070 that “g+1” is equal to‘,’ the process 2898 moves to state 3072 wherein “tplVL[a][idxc1]” isincremented by 10 again, “missCnt” is incremented by one, “idxg” isincremented by two, and “missVL[tp1]” is incremented by 10, and thenmoves to the decision state 3146. Otherwise, the process 2898 movesdirectly to the decision state 3146. If the result of the decision state3064 is not in the affirmative, the process 2898 moves to state 3068 andthen moves to state 3078.

Thereafter, the process 2898 moves to state 3080 wherein “idxg” isincremented by one, “g” is set to “Gtplgy[idxc1][idxo][idxg]” and one isassigned to “mtchg” and then moves to the decision state 3082. If theresult of the decision state 3082 is in the affirmative, the process2898 moves to state 3084 to increment “idxk”, set “mtchq” to zero, andcompute “tp1”, “subcc[0]”, and “subc[0]”. The process 2898 moves tostate 3086 wherein allows states 3088-to-3098 to be repeated for kq=0, .. . , kv−1 and then moves to the decision state 3088. If the result ofthe decision state 3088 is in the affirmative, the process 2898 moves tothe decision state 3090. If a determination is made in the decisionstate 3090 that “g” is equal to ‘*’, the process 2898 moves to state3092 to assign one to “mtchq” and set “kp[idxk]” to “kp[idxk−1]” andthen moves to the decision state 3100. Otherwise, the process 2898 movesto the decision state 3094. If the results of the decision state 3094are in the affirmative, the process 2898 moves to state 3096 to assignone to “mtchq” and set “kp[idxk]” to “kq” and then moves to the decisionstate 3100. Otherwise, the process 2898 moves to the decision state3098. If the result of the decision state 3098 is in the affirmative,the process 2898 moves to state 3086 to begin another cycle. Otherwise,the process 2898 moves to the decision state 3100. If a determination ismade in the decision state 3100 that “mtchq” is not equal to zero, theprocess 2898 moves to state 3102 wherein “mtchq” is set to zero, “idxk”is incremented by one, and “tp1”, “subcc[1]”, and “subc[1]” are computedand then moves to state 3104 wherein allows states 3106-to-3128 to berepeated for kq=0, . . . , kv−1. The process 2898 moves to the decisionstate 3106. If the result of the decision state 3106 is in theaffirmative, the process 2898 moves to the decision state 3108. If thedecision state 3108 is in the affirmative, the process 2898 moves tostate 3110 to set “mtchq” to one and compute “kp[idxk]” and then movesto the decision state 3128. Otherwise, the process 2898 moves to thedecision state 3112. If the results of the decision state 3112 are inthe affirmative, the process 2898 moves to state 3114 to set “mtchr” tozero and then moves to state 3116 wherein allows states 3118-to-3122 tobe repeated for s1=0, . . . , (idxk−1)/2−1. The process 2898 moves tothe decision state 3118. If the results of the decision state 3118 arein the affirmative, the process 2898 moves to state 3120 to set “mtchv”to one and then moves to the decision state 3122. Otherwise, the process2898 moves directly to the decision state 3122. If a determination ismade in the decision state 3122 that s1<(idxk−1)/2−1, the process 2898moves to state 3116 to begin another cycle. Otherwise, the process 2898moves to the decision state 3124. If a determination is made in thedecision state 3124 that “mtchv” is equal to zero, the process 2898moves to state 3126 to set “mtchq” to one and set “kp[idxk]” to “kq” andthen moves to the decision state 3130. Otherwise, the process 2898 movesto the decision state 3128. If the results of the decision state 3082are not in the affirmative, the process 2898 moves to the decision state3130. If the results of the decision state 3106 are not in theaffirmative, the process 2898 moves to the decision state 3128. If theresults of the decision state 3112 are not in the affirmative, theprocess 2898 moves to the decision state 3128. If a determination ismade in the decision state 3128 that kq<kv−1, the process 2898 moves tostate 3104 to begin another cycle. Otherwise, the process 2898 moves tothe decision state 3130. If a determination is made in the decisionstate 3100 that “mtchq” is equal to one, the process 2898 moves to state3132 to increment “idxg” by one, then moves to state 3144 and then movesto the decision state 3142. Otherwise, the process 2898 moves to state3134 wherein “tplVL[a][idxc1]” is incremented by 10, “missCnt” and“idxk” are incremented by one, and “missVL[tp1]” is incremented by 10,and then moves to the decision state 3136. If the result of the decisionstate 3136 is in the affirmative, the process 2898 moves to state 3138wherein “tplVL[a][idxc1]” and “missVL[tp1]” are incremented by 10,“idxg” is incremented by three, and “missCnt” is incremented by one, andthen moves to the decision state 3142. Otherwise, the process 2898 movesto state 3140 to increment “idxg” by one and then moves to the decisionstate 3142. If the results of the decision state 3142 are in theaffirmative, the process 2898 moves to state 3080 to begin anothercycle. Otherwise, the process 2898 moves to the decision state 3146. Ifthe result of the decision state 3146 is in the affirmative, the process2898 moves to state 3148 to set “missCntTplVL[a][idxc1]” to zero andthen moves to the decision state 3150. If a determination is made in thedecision state 3150 that “misscnt” exceeds zero, the process 2898 movesto state 3152 to revise “tplVL[a][idxc1]” and “missCntTplVL[a][idxc1]”and then moves to state 3154 to increment “idxk” by one. Otherwise, theprocess 2898 moves directly to state 3154.

Next, the process 2898 moves to state 3158 wherein allows states3160-to-3178 to be repeated for i=0, . . . , pnum[a]−1. The process 2898moves to state 3160 wherein allows states 3162-to-3176 to be repeatedfor j=0, . . . , knum[a][i]−1 and then moves to the decision state 3162.If the result of the decision state 3162 is not in the affirmative, theprocess 2898 moves to state 3164 to increment “k1” by one and then movesto the decision state 3166. If the result of the decision state 3166 isin the affirmative the process 2898 moves to the decision state 3168. Ifthe result of the decision state 3168 is in the affirmative the process2898 moves to state 3170 to increment “tcnt” by one and then moves tothe decision state 3172. If a determination is made in the decisionstate 3172 that “tcnt” is greater than “extraTp1” the process 2898 movesto state 3174 to set “extrTp1[k1]” to one, and then increment“tplVL[a][idxc1]” and “noMtchPtsTplVL[a][idxc1]” by 10 and then moves tothe decision state 3176. Otherwise, the process 2898 moves directly tothe decision state 3176. If the result of the decision state 3162 is inthe affirmative, the process 2898 moves to the decision state 3176. Ifthe result of the decision state 3166 is not in the affirmative, theprocess 2898 moves directly to the decision state 3176. If the result ofthe decision state 3168 is not in the affirmative, the process 2898moves directly to the decision state 3176. If the result of the decisionstate 3176 is in the affirmative, the process 2898 moves to state 3160to begin another cycle. Otherwise, the process 2898 moves to thedecision state 3178. If the result of the decision state 3178 is in theaffirmative, the process 2898 moves to state 3158 to begin anothercycle. Otherwise, the process 2898 terminates at an end state 3180. Ifthe result of the decision state 3146 is not in the affirmative, theprocess 2898 terminates at the end state 3180.

FIG. 59 shows state 3068 of the process 2898. FIG. 60 illustrates theoverall process 3068 as it uses some of the variables pre-stored in thedatabase (see FIG. 58). The process 3068 begins at a start state 3202and moves to state 3204 to assign “Gtplgy[idxc1][idxo][0]” to “g”. Theprocess 3068 moves to state 3206 wherein allows states 3208-to-3342 tobe repeated for v=0, 1 and then moves to state 3208 to initialize“codeCnc” to −1, whereby “codeCnc” refers to the connection code (seeFIG. 47). The process 3068 moves to the decision state 3210. If adetermination is made in the decision state 3210 that “g” is equal to‘U’, the process 3068 moves to state 3220 to set “codcCnc” to −2 andthen moves to the decision state 3218. Otherwise, the process 3068 movesto the decision state 3212. If a determination is made in the decisionstate 3212 that “g” is equal to ‘D’, the process 3068 moves to state3222 to set “codeCnc” to −4 and then moves to the decision state 3218.Otherwise, the process 3068 moves to the decision state 3214. If adetermination is made in the decision state 3214 that “codeCnc” is equalto −1, the process 3068 moves to state 3216 to compute “codeCnc” asdescribed in the look-up table shown in FIG. 47 and then moves to thedecision state 3218. Otherwise, the process 3068 moves directly to thedecision state 3218. If a determination is made in the decision state3218 that codeCnc>=10, the process 3068 moves to state 3224 to divide“codeCnc” by 10 and then moves to the decision state 3226. Otherwise,the process 3068 moves directly to the decision state 3226. If adetermination is made in the decision state 3226 that “choose” is equalto zero, the process 3068 moves to state 3228 to set “v1” to “v” andthen moves to state 3232 to compute “osubcc”, “num”, p8” and “k8” andset both “prcd” and “op” to one. Otherwise, the process 3068 moves tostate 3230 to set “v1” to “idxk−1+v” and then moves to state 3232.

Next, the process 3068 moves to the decision state 3234. If the resultsof the decision state 3234 are in the affirmative, the process 3066moves to state 3238 to compute “osubcc” and then moves to the decisionstate 3240. If the results of the decision state 3240 are in theaffirmative, the process 3068 moves to state 3242 to increment “op” byone and then moves to the decision state 3244. Otherwise, the process3068 moves to the decision state 3246. If the results of the decisionstate 3246 are in the affirmative, the process 3068 moves to state 3248to increment “ctoggle[idxc1][idxo]” by one and set “yes” to one and thenmoves to the decision state 3250. If a determination is made in thedecision state 3250 that “ctoggle[idxc1][idxo]” is even, the process3068 moves to state 3252 to compute “deltax” and then moves to thedecision state 3254. If the results of the decision state 3254 are inthe affirmative, the process 3068 moves to state 3256 wherein “xa1”,“ya1”, “xb1”, “yb1” and “edx” are computed and then moves to state 3258to revise “osubcc” using the present value of “osubcc” and the “edx”results, as illustrated in the look-up table shown in FIG. 48. Theprocess 3068 moves to state 3260 to assign zero to “prcd” and then movesto the decision state 3244. If the result of the decision state 3244 isin the affirmative, the process 3068 moves to state 3238 to beginanother cycle. Otherwise, the process 3068 moves to the decision state3262. If a determination is made in the decision state 3250 that“ctoggle[idxc1][idxo]” is odd, the process 3068 moves to state 3260. Ifthe results of the decision state 3254 are not in the affirmative, theprocess 3068 moves to the decision state 3260.

Next, from the decision state 3262, the process 3068 moves to thedecision state 3264. If the results of the decision state 3264 are inthe affirmative, the process 3068 moves to state 3268 wherein “xstrt”,“ystrt”, “xdel”, “ydel”, “xpoint[v]” and “ypoint[v]” are computed andthen moves the decision state 3270. Otherwise, the process 3068 movesdirectly to the decision state 3270. If the result of the decision state3262 is not in the affirmative, the process 3068 moves to the decisionstate 3270. If the result of the decision state 3270 is in theaffirmative, the process 3068 moves to state 3272 to compute “x1”, “y1”,“x2” and “y2” and then moves to the decision state 3274. If adetermination is made in the decision state 3274 that y1>y2, the process3068 moves to state 3278 to assign “x1” to “xpoint[v]” and “y1” to“ypoint[v]” and then moves to the decision state 3280. Otherwise, theprocess 3068 moves to state 3276 to assign “x2” to “xpoint[v]” and “y2”to “ypoint[v]” and then moves to the decision state 3280. If the resultof the decision state 3270 is not in the affirmative, the process 3068moves to the decision state 3280. If a determination is made in thedecision state 3280 that “codeCnc” is equal to −4, the process 3068moves to state 3280 to compute “x1”, “y1”, “x2” and “y2” and then movesto the decision state 3284. If a determination is made in the decisionstate 3284 that y1<y2, the process 3068 moves to state 3288 to assign“x1” to “xpoint[v]” and “y1” to “ypoint[v]” and then moves to thedecision state 3290. Otherwise, the process 3068 moves to state 3286 toassign “x2” to “xpoint[v]” and “y2” to “ypoint[v]” and then moves to thedecision state 3290. If the results of the decision state 3290 are inthe affirmative, the process 3068 moves to state 3292 to set “caseO” tozero and then moves to the decision state 3294. If the results of thedecision state 3294 are in the affirmative, the process 3068 moves tostate 3296 wherein “l1” is computed and “xlpt” and “ylpt” areinitialized to −1 and then moves to the decision state 3298. If adetermination is made in the decision state 3298 that l1>=0, the process3068 moves to state 3300 wherein one is assigned to “caseO”, and“xlpt[v]” and “ylpt[v]” are computed and then moves to state 3302 tocompute “fromSubcc” and “toSubcc”. If the results of the decision state3294 are not in the affirmative, the process 3068 moves to state 3302.If the result of the decision state 3294 is not in the affirmative, theprocess 3068 moves to state 3302. If the result of the decision state3298 is not in the affirmative, the process 3068 moves to state 3302.

Next, from state 3302 the process 3068 moves to the decision state 3304.If the results of the decision state 3304 are in the affirmative, theprocess 3068 moves to state 3306 to revise “fromSubcc” using a look-uptable shown in FIG. 49 and then moves to the decision state 3322. If theresults of the decision state 3304 are not in the affirmative, theprocess 3068 moves to the decision state 3322. If the results of thedecision state 3322 are in the affirmative, the process 3068 moves tostate 3324 to revise “toSubcc” using a look-up table shown in FIG. 49and then moves to states 3332-to-3340. Otherwise, the process 3068 movesdirectly to states 3332-to-3340 wherein “pt_code” (see FIG. 51 and FIG.53 by way of example), “x1”, “y1”, “x2”, “y2”, “rpt”, “cpt” (see FIG.52), “xpoint[v]”, “ypoint[v]”, “poly[v]” and “karc[v]” are computed andthen moves to the decision state 3342.

As another preferred embodiment of the invention, mappings are stored inthe database from each arcpoly's (i) major point code and (ii) majorpoints' locations to determine the arcpoly's point location, “rpt”,“cpt,” being indicative of a connection point location. Moreover,wherein major point codes are used to locate an arcpoly's extreme pointand during the presence of line-to-line and arc-to-arc directionalshifts and comprise ‘U’ for “up”, ‘D’ for “down”, ‘L’ for “left”, ‘R’for “right”, ‘0’ for “up-right”, ‘1’ for “down-right”, ‘2’ for“down-left”, and ‘3’ for “up-left” (see FIG. 51).

As another preferred embodiment of the invention, mappings and inversemappings are stored in the database from/to (i) each derived arcpoly'stopological code and (ii) logical symbol, to/from major point codes.Note that “pt_code” refers to the connection code pertaining to theextreme points, and “rpt” and “cpt” refer to one of the major points ofthe arcpoly belonging to alphanumeric “a”. If a determination is made inthe decision state 3342 that “v” is less than 1, the process 3068 movesto state 3206 to begin another cycle. Otherwise, the process 3068 movesto state 3344 to compute “dis” and then moves to the decision state3346. If the results of the decision state 3346 are in the affirmative,the process 3068 moves to state 3348 to revise “dis” and then moves tostate 3350 to compute “delta7”. Otherwise, the process 3068 movesdirectly to state 3350. The process 3068 moves to the decision state3352. If the results of the decision state 3352 are in the affirmative,the process 3068 moves to state 3354 to revise “dis” and then moves tostate 3360 to compute “prcd7”. Otherwise, the process 3068 movesdirectly to state 3360.

Next, the process 3068 moves to the decision state 3362. If the resultsof the decision state 3362 are in the affirmative, the process 3068moves to state 3366 to increment “mtchTp1” by one, and compute“vxpt[mtchTp1−1][0]”, “vypt[mtchTp1−1][0]”, “vxpt[mtchTp1−1][1]”,“vypt[mtchTp1−1][1]”, and “Nscemi” and then moves to the decision state3368. If a determination is made in the decision state 3368 thatdis<Ncsemi, the process 3068 moves to state 3372 to increment“tplVL[a][idxc1]” by “Ncsemi” and then moves to the decision state 3374.Otherwise, the process 3068 moves to state 3370 to increment“tplVL[a][idxc1]” by “dis” and then moves to the decision state 3374. Ifthe results of the decision state 3374 are in the affirmative, theprocess 3068 moves to state 3376 wherein “discrd” and “circlediscrd” areset to one, and then terminates at an end state 3386. Otherwise, theprocess 3068 moves directly to the decision state 3378. If the resultsof the decision state 3378 are in the affirmative, the process 3068moves to the decision state 3380. If the results of the decision state3380 are in the affirmative, the process 3068 moves to state 3382 to set“discrd” to one and then terminates at the end state 3386. Otherwise,the process 3068 moves to the decision state 3384. If the results of thedecision state 3384 are in the affirmative, the process 3068 moves tostate 3382 and then terminates at the end state 3384. If the results ofthe decision state 3378 are not in the affirmative, the process 3068terminates at the end state 3384.

FIG. 3 shows state 108 of the process 40. FIG. 61 illustrates theoverall process 108 as it begins at a start state 3400 and moves tostate 3402 wherein a subset of the variables pertaining to thecomputation of the best alphanumeric candidate symbol are initialized.The process 108 moves to state 3404 to compute “tsc” and then moves tothe decision state 3406. If a determination is made in the decisionstate 3406 that “vnumr” exceeds “NextrUnmtch[a][idxc10]”, the process108 moves to state 3408 to set “val” to “vnumr” and then moves to thedecision state 3412. Otherwise, the process 108 moves to state 3410 toset “val” to “NextrUnmtch[a][idxc1]” and then moves to the decisionstate 3412. If the result of the decision state 3412 is in theaffirmative, the process 108 moves to state 3414 wherein “Ccnd10”,“idxc10”, “tsc” are computed and “strt” is set to 2 and “cnd” is setto 1. The process 108 moves to the decision state 3416. If adetermination is made in the decision state 3416 that “vnumr” exceeds“NextrUnmtch[a][idxc10]”, the process 108 moves to state 3418 wherein“val” is set to “vnumr” and then moves to state 3422 wherein allowsstates 3424-to-3434 to be repeated for j=0, . . . , numCmnC[a]−1. If theresults of the decision state 3412 are not in the affirmative, theprocess 108 moves to state 3422. The process 108 moves to state 3424 toassign one to “prcd”. If the result of the decision state 3416 is not inthe affirmative, the process 108 moves to state 3420 to assign“NextrUnmtch[a][idxc10]” to “val”, then moves to state 3420, followed bystates 3422 and 3424.

Next, the process 108 moves to the decision state 3426. If the resultsof the decision state 3426 are in the affirmative, the process 108 movesto the decision state 3428. If the results of the decision state 3428are in affirmative, the process 108 moves to state 3430 to set “prcd” tozero and then moves to the decision state 3434. Otherwise, the process108 moves directly to the decision state 3434. If the results of thedecision state 3426 are not in the affirmative, the process 108 moves tothe decision state 3432. If the result of the decision state 3432 is inthe affirmative, the process 108 moves to state 3430 and then moves tothe decision state 3434. Otherwise, the process 108 moves directly tothe decision state 3434. If the results of the decision state 3434 arein the affirmative, the process 108 moves to state 3422 to begin anothercycle. Otherwise, the process 108 moves to the decision state 3436. If adetermination is made in the decision state 3436 that numCmnC[a]>1, thenthe process 108 moves to state 3438 wherein allows states 3440-to-3458to be repeated for j=0, numCmnC[a]−1 and then moves to state 3440 tocompute “Ccnd10” and “idxc10”. The process 108 moves to the decisionstate 3442. If a determination is made in the decision state 3442 that“vnumr” is greater than “NextrUnmtch[a][idxc10]”, the process 108 movesto state 3444 to assign “vnumr” to “val” and then moves to the decisionstate 3448. Otherwise, the process 108 moves to state 3446 to set “val”to “NextrUnmtch[a][idxc10]” and then moves to the decision state 3448.

Next, if the results of the decision state 3448 are in the affirmative,the process 108 moves to state 3450 to compute “fctr” and then moves tothe decision state 3452. If the results of the decision state 3452 arein the affirmative, the process 108 moves to the decision state 3454. Ifa determination is made in the decision state 3454 that fctr<tsc, theprocess 108 moves to state 3456 to set “tsc” to “fctr” and assign “j” to“end” and then moves to the decision state 3458. If the results of thedecision state 3448 are not in the affirmative, the process 108 moves tothe decision state 3458. If the results of the decision state 3452 arenot in the affirmative, the process 108 moves to the decision state3458. If the result of the decision state 3454 is not in theaffirmative, the process 108 moves to the decision state 3458. If adetermination is made in the decision state 3458 that j<numCmnC[a]−1,the process 108 moves to state 3438. Otherwise, the process 108 moves tothe state 3460 to compute “Ccnd” and “scrip[a]”. If a determination ismade in the decision state 3436 that “numCmnC[a]” does not exceed one,the process 108 moves to state 3460. Thereafter, the process 108 movesto state 3462 to initialize “noC” and “noCC” to −1. The process 108terminates at an end state 3464.

Symbolic Reshaping

FIG. 3 shows state 116 of the process 40. FIG. 62 illustrates theoverall process 116. This process in particular employs the second phaseof the symbolic reshaping scheme, which in general comprises the firstand third phases of this scheme, as well. As another embodiment of thisinvention, alternative sets of reduced candidate alphanumeric symbolsare generated via selective reshaping of the arcpolys belonging to thealphanumeric ID. Consequently, augmented set of symbolic representationsper arcpoly are generated for the alphanumeric ID.

The structural and combined reshaping processes are illustrated in FIG.50 by way of example and the derived variance types and levels areillustrated in FIG. 56. As another preferred embodiment of theinvention, this phase of the symbolic reshaping comprises an orderedsequence of structural, topological and/or combined reshaping of eacharcpoly, each time generating a new reduced candidate alphanumericsymbol list and alphanumeric dissimilarity value, until a candidatealphanumeric symbol is validated.

Moreover, the examples pertaining to the re-shaping process comprise:arc-to-arc rotation, line-to-line rotation, arc depth size variance, arcextreme points' size variance, existence/or absence of arc extension oneach (or both) extreme point(s), line extreme points' size variance,variances, and combined variances (see FIG. 50). The reshaping of anarcpoly involves applying at least one of: multi-level unit rotations,changes in extreme points' size and depth size on the arcpoly, each timetransforming the arcpoly into a new arcpoly having a new orientationand/or new shape. This process is then followed by computing symbolicrepresentation of the alphanumeric ID, generating a reduced list ofcandidate alphanumeric symbols, computing the secondary relationalfeatures per candidate alphanumeric symbols, etc.

In summary, the process 116 computes alternative set(s) of reduced listsof alphanumeric candidate symbols per alphanumeric “a” that involvessuccessive symbolic transformation of logical- and subclass-symbolspair(s) to one another, each time incorporating an additive bi-polarauxiliary rotation, “level[a][p][k]” ranging in value betweenzero-to-four units, utilizing the following tasks described below:

-   -   i) select a series of predetermined number of remaining unused        subclass symbol(s) (if any) each time per logical symbol and        compute primary relational features, then compute alternative        set(s) of reduced list of alphanumeric candidate symbols and        their descriptors and next compute secondary relational features        as well as their confidence levels, and/or    -   ii) incorporate a series of extreme points' size and depth size        variances to the arcpoly belonging to alphanumeric “a”, compute        primary relational features and alternative set(s) of reduced        list of alphanumeric candidate symbols and next compute their        descriptors and secondary relational features as well as their        confidence levels.

The process 116 begins at a start state 3500 and moves to state 3502wherein subsets of the variables pertaining to the structural reshapingare initialized. The process 116 moves to state 3504 wherein “level1” isincremented by one to a maximum of four, and then moves to state 3506wherein allows states 3508-to-3424 to be repeated for p=0, . . . ,pnum[a]−1. The process 116 moves to state 3508 wherein allows states3510-to-3422 to be repeated for k=0, . . . , knum[a][p]−1 and then movesto the decision state 3510. If the results of the decision state 3510are in the affirmative, the process 116 moves to the decision state3512. If the results of the decision state 3512 are in the affirmative,the process 116 moves to state 3518 wherein deviations for the remainingsub-class symbols per rotation level, “level1” are computed. The process116 moves to state 3520 to set “level[a][p][k]” to “level1” and thenmoves to the decision state 3522. If the result of the decision state3522 is in the affirmative, the process 116 moves to state 3508 to beginanother cycle. Otherwise, the process 116 moves to the decision state3524. If the result of the decision state 3524 is in the affirmative,the process 116 moves to state 3506 to begin another cycle. Otherwise,the process 116 moves to the decision state 3526. If the results of thedecision state 3510 are not in the affirmative, the process 116 moves tostate 3514 to set “stp” to one and then terminates at an end state 3516.If the results of the decision state 3512 are not in the affirmative,the process 116 moves to state 3514 and then terminates at the end state3516. If the results of the decision state 3526 are not in theaffirmative, the process 116 terminates at the end state 3516.Otherwise, the process 116 moves to state 3528 wherein allows states3530-to-3442 to be repeated for p=0, . . . , pnum[a]−1. The process 116moves to state 3530 wherein allows states 3532-to-3440 to be repeatedfor k=0, . . . , knum[a][p]−1. The process 116 moves to the decisionstate 3532. If the results of the decision state 3514 are in theaffirmative, the process 116 moves to the decision state 3534. If theresults of the decision state 3534 are in the affirmative, the process116 moves to state 3536, wherein deviations for changes in extremepoints' size and depth size per rotation level are computed. The process116 moves to state 3538 to assign “level1” to “level[a][p][k]” and thenmoves to the decision state 3540. If the result of the decision state3540 is in the affirmative, the process 116 moves to state 3530 to beginanother cycle. Otherwise, the process 116 moves to the decision state3542. If the result of the decision state 3542 is in the affirmative,the process 116 moves to state 3528 to begin another cycle. Otherwise,the process 116 moves to the decision state 3544. If the results of thedecision state 3524 are not in the affirmative, the process 116terminates at an end state 3544. If the results of the decision state3544 are not in the affirmative, the process 116 terminates at the endstate 3516. Otherwise, the process 116 moves to state 3504 to beginanother cycle. If the results of the decision state 3532 are not in theaffirmative, the process 116 moves to state 3514 and then terminates atthe end state 3516. If the results of the decision state 3534 are not inthe affirmative, the process 116 moves to state 3514 and then terminatesat the end state 3516.

FIG. 62 shows state 3518 of the process 116. FIG. 63 illustrates theoverall process 3518 as it begins at a start state 3560 and moves tostate 3562 wherein a subset of the variables pertaining to thecomputation of the remaining sub-class symbols are initialized. Theprocess 3518 moves to state 3564 wherein allows the states 3566-to-3604to be repeated for q=0, . . . , numSubClassOpt[a][p][k]−1, and thenmoves to the decision state 3566. If a determination is made in thedecision state 3566 that “success” is equal to zero, the process 3518moves to the decision state 3568. If the result of the decision state3568 is in the affirmative, the process 3518 moves to state 3570 wherein“scnd2[a][p][k][subcc[a][p][k][q]]” is set to one and then moves tostate 3572 wherein “numOsubcs2[a][p][k][scclass]” is initialized tozero, where “scclass” is equal to “subcc[a][p][k][q]”. Otherwise, theprocess 3518 moves directly to state 3572.

Next, the process 3518 moves to state 3574 wherein the states3576-to-3580 are repeated for j=0, . . . , numSubc[scclass]−1, and thenmoves to the decision state 3576. If the results of the decision state3576 are in the affirmative, the process 3518 moves to state 3578 toincrement “numOsubcs2[a][p][k][scclass]” by one, and to compute “nump”,and “othrSubcs2[a][p][k][scclass][nump−1]” and then moves to thedecision state 3580. If the results of the decision state 3576 are notin the affirmative, the process 3518 moves directly to the decisionstate 3580. If the result of the decision state 3580 is in theaffirmative, the process 3518 moves to state 3574 to begin anothercycle. Otherwise, the process 3518 moves to the decision state 3582. Ifa determination is made in the decision state 3582 that“numOsubcs2[a][p][k][subcc[a][p][k][q]]” is greater than zero, theprocess 3518 moves to state 3584 as described in FIG. 55 and FIG. 65,and then moves to the decision state 3586. If the results of thedecision state 3586 are in the affirmative, the process 3518 moves tostate 3588 to compute the evidence-based alphanumeric candidatesymbol(s) list and then moves to the decision state 3590. If adetermination is made in the decision state 3590 that there is a netgain in the number of evidenced-based invocations of the alphanumericcandidate symbols, the process 3518 then moves to state 3592 wherein allnon-discarded list of alphanumeric candidate symbols as well as theirrelational features are computed, and then moves to the decision state3594. If the result of the decision state 3594 is in the affirmative,the process 3518 moves to state 3596, and then moves to state 3698 toestablish credibility. The process 3518 moves to the decision state3600. If the result of the decision state 3600 is in the affirmative,the process 3518 moves to state 3602 to set “stp” to one and thenterminates at an end state 3606. Otherwise, the process 3518 moves tothe decision state 3604. If the result of the decision state 3590 is notin the affirmative, the process 3518 moves to the decision state 3604.If the result of the decision state 3594 is not in the affirmative, theprocess 3518 moves to the decision state 3604. If the result of thedecision state 3580 is not in the affirmative, the process 3518 moves tothe decision state 3604. If the result of the decision state 3604 is inthe affirmative, the process 3518 moves to state 3564 to begin anothercycle. Otherwise, the process 3518 terminates at the end state 3606. Ifthe result of the decision state 3566 is not in the affirmative, theprocess 3518 terminates at the end state 3606. If the result of thedecision state 3582 is not in the affirmative, the process 3518terminates at the end state 3606. If the result of the decision state3586 is not in the affirmative, the process 3518 terminates at the endstate 3606.

FIG. 62 shows state 3536 of the process 116. FIG. 64 illustrates theoverall process 3536 as it begins at a start state 3700 and moves tostate 3702 wherein a subset of the variables pertaining to thecomputation of deviations for changes in extreme points' size and depthsize are initialized. The process 3536 moves to state 3704 as describedin FIG. 54 and as described as the process 3704A above, a subset of theprocess 3704. The process 3536 then moves to the decision state 3706. Ifthe result of the decision state 3706 is in the affirmative, the process3536 moves to the decision state 3708. If the result of the decisionstate 3708 is in the affirmative, the process 3536 moves to state 3710to compute the evidenced-based invocation(s) of the alphanumericcandidate symbol(s) list and then moves to the decision state 3712. If adetermination is made in the decision state 3712 that there is a netgain in the number of evidenced-based invocation(s) of the alphanumericcandidate symbol(s) list, the process 3536 moves to state 3714, whereinall non-discarded list of alphanumeric candidate symbol(s) as well astheir secondary relational features are computed, and then moves to thedecision state 3716. If the result of the decision state 3716 is in theaffirmative, the process 3536 moves to state 3718, wherein the bestalphanumeric candidate symbol and the accompanied secondary relationalfeatures are selected, and then moves to state 3720 to establishcredibility. The process 3536 moves to the decision state 3722. If theresult of the decision state 3722 is in the affirmative, the process3536 moves to state 3724 to set “stp” to one and then terminates at anend state 3726. Otherwise, the process 3536 terminates directly at theend state 3726. If the result of the decision state 3712 is not in theaffirmative, the process 3536 terminates at the end state 3726. If theresult of the decision state 3716 is not in the affirmative, the process3536 terminates at the end state 3726. If the result of the decisionstate 3706 is not in the affirmative, the process 3536 terminates at theend state 3726. If the result of the decision state 3708 is not in theaffirmative, the process 3536 terminates at the end state 3726.

FIG. 63 shows state 3584 of the process 3518. FIG. 65 illustrates theprocess 3584A as a subset of the process 3584 (see FIG. 55, whereby theparameters passed include the following: (1) “ed” as extreme points'direction, (2) “es” as extreme points' size, (3) “dd” as depthdirection, (4) “ds” as depth size, (5) “vsubcc” as the logical symbol).The process 3584A is described below using a detailed 26 step process,for a single alphanumeric “a”, polyline “p” and arcpoly “k”:

The process 3584A begins at a start state 3740 and moves to state 3742to initialize the variables pertaining to the computation of theremaining sub-class symbol's newly transformed arcpoly(s). The 3584Amoves to state 3744 wherein “strtsubcc”, “strtsubc”, “optsubcc” and“optsubc” are computed. The process 3584A moves to the decision state3746. If the result of the decision state 3746 is in the affirmative,the process 3584A moves to state 3748 to set “subcc[a][p][k][optsubcc]”and “scclass” to “vsubcc” and then moves to the decision state 3752.Otherwise, the process 3584A moves to state 3750 to set“subcc[a][p][k][optsubcc]” and “scclass” to “subcc[a][p][k][optsubcc−1]”and then moves to the decision state 3752. If a determination is made inthe decision state 3752 that “scclass” is less than or equal to eight,the process 3584A moves to state 3754 to assign zero to “line” and thenmoves to state 3758. Otherwise, the process 3584A moves to state 3756 toassign one to “line” and then moves to state 3758 wherein allows states3560-to-3564 to be repeated for r=0, . . . , optsubcc−1.

Next, the process 3584A moves to the decision state 3760. If the resultof the decision state 3760 is in the affirmative, the process 3584Amoves to state 3762 to set “mtchr” to one and assign “r” to “idxr” andthen moves to the decision state 3766. Otherwise, the process 3584Amoves to the decision state 3764. If a determination is made in thedecision state 3764 that r<optsubcc−1, the process 3584A moves to state3758 to begin another cycle. Otherwise, the process 3758 moves to thedecision state 3766. If a determination is made in the decision state3766 that “mtchr” is equal to zero, the process 3758 moves to state 3768wherein “scc_rotVL[a][p][k][optsubcc]” and“scc_dptSizeVL[a][p][k][optsubcc]” are set to“scc_rotVL[a][p][k][optsubcc−1]” and“scc_dptSizeVL[a][p][k][optsubcc−1]”, respectively and then moves tostate 3772 to compute “scc_e”, “scc_d”, and “scc_x”. Otherwise, theprocess 3584A moves to state 3770 wherein “scc_rotVL[a][p][k][optsubcc]”and “scc_dptSizeVL[a][p][k][optsubcc]” are set to the respective“scc_rotVL[a][p][k][idxr]” and “scc_dptSizeVL[a][p][k][idxr]”, and thenmoves to state 3772.

Next, the process 3584A moves to the decision state 3774. If adetermination is made in the decision state 3774 that “line” is equal toone, the process 3774 moves to state 3776 to assign “ds” to“scc_dptSizeVL[a][p][k][optsubcc]” and then moves to the decision state3780. Otherwise, the process 3584A moves to state 3778 to assign “scc_d”to “scc_dptSizeVL[a][p][k][optsubcc]”. If the results of the decisionstate 3780 are in the affirmative, the process 3584A moves to state 3782to set “maxnum” to “numOsubcs2[a][p][k][scclass]” and then moves to thedecision state 3786. Otherwise, the process 3584A moves to state 3784 toset “maxnum” to “numOsubcs[a][p][k][scclass]” and then moves to thedecision state 3786. If a determination is made in the decision state3786 that “maxnum” exceeds zero, the process 3584A moves to state 3788wherein allows states 3790-to-3852 to be repeated for j=0, . . . ,maxnum−1, and then moves to the decision state 3790. If the results ofthe decision state 3790 are in the affirmative, the process 3854 movesto state 3792 to assign “othrSubcs2[a][p][k][scclass][j]” to “1” andthen moves to state 3796 to compute “del_d[i]”. Otherwise, the process3854 moves to state 3794 to assign “othrSubcs[a][p][k][scclass][j]” to“1” and then moves to state 3796. The process 3584A moves to thedecision state 3798. If a determination is made in the decision state3798 that “line” is equal to zero, the process 3584A moves to thedecision state 3800. If the results of the decision state 3800 are notin the affirmative, the process 3684 moves to state 3804 to assign“scc_d−sc_d[scclass][i]” to “del_d[i]” and then moves to state 3806wherein “del_e[i]” is computed. Otherwise, the process 3584A moves tostate 3802 to assign 10 to “del_d[i]” and then moves to state 3806. If adetermination is made in the decision state 3798 that “line” is notequal to zero, the process 3584A moves directly to state 3806.

Next, the process 3584A moves to the decision state 3808. If the resultof the decision state 3808 is in the affirmative, the process 3584Amoves to state 3810 to assign zero to “del_x[i]” and then moves to thedecision state 3814. Otherwise, the process 3584A moves to state 3812 toassign five to “del_x[i]” and then moves to the decision state 3814. Ifthe results of the decision state 3814 are in the affirmative, theprocess 3584A moves to state 3816 to assign ten to “del_x[i]” and thenmoves to state 3818 to increment “optsubcc” by one. Otherwise, theprocess 3584A moves directly to state 3818. The process 3584A moves tostate 3820 to set “depthP[a][p][k][optsubc]” and“endptP[a][p][k][optsubc]” to one, and then moves to the decision state3822. If a determination is made in the decision state 3822 that“del_e[i]” is less than zero, the process 3584A moves to state 3824 torevise “del_e[i]” and set “endptP[a][p][k][optsubc]” to zero, and thenmoves to the decision state 3826. If the result of the decision state3826 is in the affirmative, the process 3584A moves to state 3828 torevise “del_d[i]” and set “depthP[a][p][k][optsubc]” to zero and thenmoves to state 3830 to double the value of “del_d[i]”. The process 3584Amoves to the decision state 3832. Otherwise, the process 3584A movesdirectly to state 3830 and then moves to the decision state 3832. If theresults of the decision state 3832 are in the affirmative, the process3584A moves to state 3834 to set “delta[i]” to“del_e[i]+“del_d[i]+“del_x[i]” and then moves to state 3838 to determine“delE[a][p][k][optsubc]”, “delD[a][p][k][optsubc]”, and“delX[a][p][k][optsubc]”. Otherwise, the process 3584A moves to state3834 to set “delta[i]” to 1000 and then moves to state 3838.

Next, the process 3584A moves to the decision state 3840. If the resultof the decision state 3840 is in the affirmative, the process 3584Amoves to state 3842 to update the value of “delD[a][p][k][optsubc]” andthen moves to state 3844 to compute “indx1[a][p][k][optsubc]” and“sc_VL[a][p][k][optsubc]”. Otherwise, the process 3584A moves directlyto state 3844. The process 3584A moves to the decision state 3846. If adetermination is made in the decision state 3846 that“sc_VL[a][p][k][optsubc]” is equal to 1000, the process 3584A moves tostate 3848 to decrement “optsubcc” by one and then moves to state 3850to determine “maxs”. Otherwise, the process 3584A moves directly tostate 3850. The process 3584A moves to the decision state 3852. If theresults of the decision state 3852 are in the affirmative, the process3584A moves to 3788 to begin another cycle. Otherwise, the process 3584Amoves to the decision state 3854. If the result of the decision state3786 is not in the affirmative, the process 3584A moves to the decisionstate 3854. If a determination is made in the decision state 3854 that“maxs” is equal to zero, the process 3584A moves to state 3856 todecrement “optsubcc” by one and assign one to “useless” and then movesto the decision state 3858. Otherwise, the process 3584A moves directlyto the decision state 3858. If the results of the decision state 3858are in the affirmative, the process 3584A moves to the decision state3860. If the results of the decision state 3860 are in the affirmative,the process 3584A moves to state 3862 to set “mtchg” to zero and thenmoves to state 3864 wherein allows states 3866-to-3870 to be repeatedfor q=0, . . . , maxs−1. The process 3584A moves to the decision state3866. If the results of the decision state 3866 are in the affirmative,the process 3584A moves to state 3868 to assign one to “mtchg” and thenmoves to the decision state 3870. Otherwise, the process 3584A movesdirectly to the decision state 3870. If the result of the decision state3870 is in the affirmative, the process 3584A moves to state 3864 tobegin another cycle. Otherwise, the process 3584A moves to the decisionstate 3872. If the result of the decision state 3872 is in theaffirmative, the process 3584A moves to state 3874 to set “chng” tozero, “sameRslts” to one, decrement “optsubcc” by one and decrement“optsubc” by “maxs”, and then moves to the decision state 3876.Otherwise, the process 3584A moves directly to the decision state 3876.If the results of the decision state 3858 are not in the affirmative,the process 3584A moves directly to the decision state 3876. If theresults of the decision state 3860 are not in the affirmative, theprocess 3584A moves directly to the decision state 3876.

Next, if a determination is made in the decision state 3876 that “maxs”is greater than zero, the process 3584A moves to state 3878 wherein“numSubClassOpt[a][p][k]” and “numSCopt[a][p][k]” are computed and thenmoves to the decision state 3880. If the results of the decision state3880 are in the affirmative, the process 3584A moves to state 3882 todetermine “delsc” and then moves to state 3884 wherein allows states3886-to-3888 to be repeated for h=0, . . . , maxs−1. The process 3584Amoves to state 3886 to increment by one “osnum[a][p][k][scclass]” anddetermine “othrSC2[a][p][k][scclass][osnum[a][p][k][scclass]]” and thenmoves to the decision state 3888. If a determination is made in thedecision state 3888 that h<maxs−1, the process 3584A moves to state 3884to begin another cycle. Otherwise, the process 3584A moves to state 3890to increment “numSubcO[a][p][k][scclass]” by “maxs” and then moves tostate 3892 wherein “num1”, “op” and “op1” are determined. The process3584A moves to state 3894 to decrement “op” by one and then moves to thedecision state 3896. If the results of the decision state 3896 are inthe affirmative, the process 3584A moves to state 3898 to increment“num1” by one, and then moves to the decision state 3902. Otherwise, theprocess 3584A moves to state 3900 to set “prc” to zero and then moves tothe decision state 3902. If a determination is made in the decisionstate 3902 that “op” exceeds one, the process 3584A moves to state 3894to begin another cycle. Otherwise, the process 3584A moves to thedecision state 3904. If the results of the decision state 3904 are inthe affirmative, the process 3584A moves to state 3906 to decrement“numSubcO[a][p][k][scclass]” by “maxs” and then terminates at an endstate 3912. Otherwise, the process 3584A moves to the decision state3906. If a determination is made in the decision state 3906 that “maxs”is equal to one, the process 3584A moves to state 3908 to set“subcOmaxs1[a][p][k][optsubc]” to “optsubcc” and then terminates at theend state 3912. Otherwise, the process 3584A terminates at the end state3912. If the result of the decision state 3874 is not in theaffirmative, the process 3584A terminates at the end state 3912. If theresults of the decision state 3880 are not in the affirmative, theprocess 3584A terminates at the end state 3912.

VI. CONCLUSION

A system for recognizing alphanumeric symbols that includes a pen anddigitizing tablet for real time entry of handwritten alphanumericsymbols and a document scanner for generating scanned images of apreviously created document containing handwritten alphanumeric symbolsby a user is disclosed. This hybrid data-directed and model-drivenartificial intelligent system adopts a spatial reasoning approachwherein computations occur on high level semantics. The multi-facetedtechniques adopted and its system components work in concert to achievehigh-level recognition accuracy. The recognition system solves thesignal-to-symbol transition using a three step process that derives ahigh-level semantic representation of each input alphanumeric pattern.This process involves criteria-based region growing and segmentation tocompute alphanumeric ID's logical- and subclass-symbols and theirrelational features. A mechanism is devised to compute the confidencelevel representing the goodness of identification of each alphanumericsymbol. At various stages of handwritten recognition process, ahypothetico-verification technique is incorporated to enable adaptationof the initial solution when results are determined to be contrary topreset milestones. Moreover, the incorporated evidence-based mechanismreduces the candidate alphanumeric symbol list. The system is capable ofstructurally re-shaping arcpolys and generating alternative set(s) ofreduced lists of candidate alphanumeric symbols per unrecognizedalphanumeric by an ordered sequence of symbolic transformation of eachdata-directed arcpoly's logical- and subclass-symbols pair to another,each time deriving a new dissimilarity value between the data-directedalphanumeric and its counter-part database modeled alphanumeric symbol.In the database, models of alphanumeric symbols and support informationfor the handwritten recognition process are incorporated in accordancewith the common-property concept whereby an alphanumeric symbol isidentified by primitive elements and their relationships. A prioriinformation is effectively used by incorporating (i) generic models,(ii) case (or exemplar) models, and (iii) supporting information(intelligence) in part used for deriving a reasonably accurate set ofvalues for ill-defined variables with a fuzzy nature. An arcpoly isrepresented by a set of primary features that uniquely describes itsshape and orientation. By integrating an unrecognized alphanumericconnection code(s) with each of its arcpoly's symbolic representation,the handwritten recognition system can uniquely represent anyalphanumeric.

A method for converting a handwritten-language image into a sequence ofalphanumeric symbols, alphanumeric symbols comprising numbers andalphabets that include letters, ascenders, descenders, and diacritical,and regular marks, each alphanumeric symbol being modeled as apre-specified number of logical- and subclass-symbols pairs andrelationship(s) code(s), the image being a sequence of strokes, eachstroke being a sequence of adjoining points with positions definable byx- and y-coordinates on a two-dimensional surface, the methodapproximating a stroke by a polyline, a polyline comprising an arcpolyor a sequence of adjoining arcpolys, an arcpoly being either an arc or aline or a point and having its net gradient directions not exceeding apre-specified value, an alphanumeric ID consisting a polyline or asequence of polylines extracted from the image data, wherein ID hererefers to the order, starting from zero, an image structure being apoint, line, arc, arcpoly, or polyline, an arc being a sequence ofadjoining lines having the same clockwise motion from one line to thenext with a net gradient directions not exceeding a pre-defined value, aclockwise motion being a Boolean variable representing the direction ofrotation, a line being a sequence of adjoining elements having the samedirections, a line direction being an encoded value derived from apre-defined high resolution 16-direction code system, an element beingtwo adjoining points, an element direction being an encoded valuederived from a pre-defined low resolution 8-direction code system, netgradient directions being the accumulation of direction differences inan 8/or 16 direction code system of all adjoining pairs of linesbelonging to an arc, adjoining elements having a common point, adjoininglines in a polyline having different directions, adjoining arcpolys in apolyline having at least one pair of adjoining arcpolys inconsistent, aconsistent pair of adjoining arcpolys being the lines of both adjoiningarcpolys having equal directions of rotation and the last line of thefirst adjoining arcpoly and the first line of the second adjoiningarcpoly having equal directions of rotation with respect to either ofthe adjoining arcpoly's direction of rotation, an arcpoly having a startpoint, mid-point, and an end point, the start point and the end pointbeing called the extreme points, the start point, midpoint, and endpoint being called the major points, a straight line segment connectingthe extreme points being called the extreme line segment, the extremepoints size being the length of the line that makes up its geometricalstructure when there is only one line, otherwise being the straight linesegment that connects the end points of the extreme edges of thearcpoly, extreme edges of an arcpoly being the farthest lines from themid-line with regards to index whose directions are not towards themid-point on the extreme line segment, for arcpolys with more than oneline a straight line connecting the end points of the arcpoly's extremeedges being called the extreme edge segment and for arcpolys with onlyone line a straight line connecting the extreme points being called theextreme edge segment, the direction of the extreme edge segment beingcalled the extreme points direction, the depth line segment being thestraight line segment that connects to the midpoint on the arcpoly froma point on the extreme line segment and is perpendicular to the extremepoints segment, the length of the depth line segment or an approximationthereof being called the depth size, the direction of the depth linesegment being called the depth direction, a line being a point when theextreme points are the same, a line being a member of a finite class oflines wherein each class member has a unique orientation, a line being amember of a finite subclass of lines wherein each subclass member has aunique extreme points size, an arc being a member of a finite class ofarcs wherein each class member has a unique orientation, an arc being amember of a finite subclass of arcs wherein each subclass member has aunique extreme points size and/or unique depth size, logical symbolsbeing a finite class of lines, arcs, and a point wherein each classmember to the exclusion of the point has a unique orientation, subclasssymbols being a finite subclass of lines, arcs, and a point wherein eachclass member to the exclusion of the point has a unique extreme pointssize and/or different depth size, arcpoly descriptors being comprised ofa primary feature set and description of the arcpoly via thesub-structures that make up its geometric structure, primary feature setrepresenting the entire structure of an arcpoly, an arcpoly primaryfeature set being comprised of extreme points direction, depthdirection, extreme points size, depth size, clockwise motion, and insomewhat rare situations presence of extension(s), an arcpoly structurecomprising shape and orientation, extension being an adjoining smallerarcpoly together forming a consistent pair of adjoining arcpolys,primary relational features being a gradient feature set between thedatabase features and a pre-determined expansion of an arcpoly featureset derived from the image, secondary relational features being anexpansion of primary relational features used for deriving dissimilaritylevel between alphanumeric ID and a database alphanumeric symbol, themethod comprising the steps of: comprising a pen and digitizing tabletfor real time entry of handwritten alphanumeric symbols by a user and,in certain implementations a scanner for generating scanned images of apreviously created document containing handwritten text or alphanumericsymbols; establishing a signal-to-symbol transition in three major stepsby deriving high-level semantic information from the image datamanifesting as arcpolys identified by their logical- and subclasssymbols and described by their features; incorporating a three phasesymbolic reshaping scheme during the handwriting recognition processthat includes: (i) deriving dissimilarity level from alphanumeric ID'snet variation and the integration of each of its arcpoly structuralvariation(s) signifying a reasonably accurate confidence level for thegoodness of recognition, (ii) determining the reshaping ortransformation of an arcpoly to another arcpoly by introducingvariations to the original arcpoly and deriving at each step, the newcost value as a function of variation(s) present and imposed, and (iii)determining the equivalent representation of an arcpoly by a successionof smaller and adjoining arcpoly(s) in order, or vice versa;establishing a hierarchical hypothesis-and-verification technique duringvarious stages of the handwriting recognition process, whereby a seriesof initial assessments are made based on the information availed uponthem and later during processing they are validated or rejecteddepending on the degree in which preset milestones were satisfied andare followed by a sequence of alternative hypotheses in the event offailure of the latest hypothesis until they are satisfied; incorporatingin database, models of alphanumeric symbols and support information forthe handwriting recognition process; reducing the computed list ofalphanumeric (candidate) symbols' search range for each alphanumeric ID;possibly further reducing the said list of alphanumeric (candidate)symbol(s) for each alphanumeric ID; incorporating a multi-stagehierarchical confidence level capability manifesting as dissimilaritycost value for each alphanumeric ID and database alphanumeric candidatesymbol, thus enabling the set of alphanumeric candidate symbols' rankingfrom best-to-worst by using their derived secondary relational features;determining the best alphanumeric symbol among the said list ofalphanumeric candidate symbol(s) for each alphanumeric ID as a functionof the derived confidence level and the number of matched and mismatched“logical- and subclass-symbols pairs,” being derived and selected fromthe said image and database, respectively; establishing eachalphanumeric candidate symbol's validation per alphanumeric ID; anddetermining alternative set(s) of reduced lists of alphanumericcandidate symbols per alphanumeric ID, each set being accompanied bydescriptors and secondary relational features as well as confidencelevels.

The above method wherein the first major step of establishing asignal-to-symbol transition includes the steps of: reducing eachpolyline or a sequence of polylines to one arcpoly or a sequence ofarcpolys and determining their descriptors and primary features; andcomputing spatial variables pertaining to the said polyline(s) andarcpoly(s).

The above method wherein the second major step of establishing asignal-to-symbol transition includes the steps of: computing(relationship(s)) code(s) pertaining to the said polylines and arcpolys;registering (or grouping) the said polyline(s) and their arcpoly(s) toeach alphanumeric ID; and grouping the said connection codes to eachalphanumeric ID.

The above method wherein the final major step of establishing asignal-to-symbol transition includes the step of computing logical- andsubclass symbols and primary relational features for each arcpolybelonging to each alphanumeric ID comprising feature variances inreference to the features pre-stored in the data-base, incorporating thefirst phase of the symbolic reshaping scheme.

The above method wherein the step of reducing each polyline or asequence of polylines to one arcpoly or a sequence of arcpolys anddetermining their descriptors and primary features includes the stepsof: hypothesizing each arcpoly; and verifying in multiple stages eacharcpoly.

The above method wherein the step of hypothesizing each arcpoly perpolyline ID includes the step of determining a pre-established criteriabased region growing and correcting process, incorporating the thirdphase of the symbolic reshaping scheme.

The above method wherein the step of determining a region growing andcorrecting process per polyline ID comprises the steps of: computing lowresolution element directions using an 8-direction code system from eachpair of x- and y-coordinates; pre-processing image data to removejitters and achieve smoothing; computing line-based representation; andcomputing clockwise-based segmentation thus producing an arcpoly or aseries of inconsistent pairs of adjoining arcpolys, and determiningtheir descriptors.

The above method wherein the step of verifying in multiple stages eacharcpoly per polyline ID, incorporating the third phase of the symbolicreshaping scheme includes the steps of: post-processing I on arcpoly(s);post-processing II on arcpoly(s); and post-processing III on arcpoly(s).

The above method wherein the step of post-processing II on arcpoly(s)per polyline ID includes the steps of: computing line-based descriptors;computing all set(s) of primary features belonging to the saidhypothesized arcpoly(s); determining type I segmentation(s) to possiblyrevise the said hypothesized arcpoly(s); determining type IIsegmentation(s) to possibly revise the said hypothesized arcpoly(s);determining type III segmentation(s) to possibly revise the saidhypothesized arcpoly(s); determining type IV segmentation(s) to possiblyrevise the said hypothesized arcpoly(s); determining type Vsegmentation(s) to possibly revise the said hypothesized arcpoly(s);selecting and implementing a segmentation type on each said hypothesizedarcpoly according to a pre-established criteria, if any; and computingall set(s) of descriptors and primary features belonging to the revisedarcpoly(s).

The above method wherein the step of post-processing III on arcpoly(s)per polyline ID includes the steps of: determining arcpoly forwarddirection search for the detection of over-extended index; determiningarcpoly backward direction search for the detection of over-extendedindex; and implementing the said segmentation type using theover-extended index derived on each said arcpoly, if over-extension isdetected.

The above method wherein the step of computing spatial variablespertaining to the said polyline(s) and arcpoly(s) includes the steps of:computing text line characteristics for each line of text; computingtext line-based characteristics per polyline ID; and detecting ascender-and descender-type(s) per polyline ID.

The above method wherein the step of pre-processing the image data toremove jitters and achieve smoothing per polyline ID comprises the stepsof: computing modular “m” difference between a pair of low resolutiondirections, using an 8-direction code system or high resolutiondirections, using a 16-direction code system, whereby “m=8” for lowresolution directions and “m=16” for high resolution directions andgenerating a new sequence of x- and y-coordinates from a sequence of lowor high resolution directions.

The above method wherein the step of determining type I segmentation(s)to possibly revise the said hypothesized arcpoly(s) includes the step ofdetermining clockwise based and modular “m” based pairwise directiondifference, whereby “m”=8 or 16.

The above method wherein the step of computing line-based representationper polyline ID includes the steps of: implementing region growing I toreduce row and column data; computing row-based median and column-basedmedian; implementing region growing II to further reduce row and columndata by using the said medians; and computing high resolution linedirections for each pair of x- and y-coordinates.

The above method wherein the step of computing each set of primaryfeatures belonging to each arcpoly per polyline ID includes the stepsof: computing clockwise motion; computing extreme points direction;computing extreme points size; computing depth direction; and computingdepth size.

The above method wherein the step of computing extreme points sizeincludes a step of determining alignment level between a pair of low orhigh resolution line directions.

The above method wherein the step of computing depth size includes thestep of determining the Boolean variable “direction_exceed.”

The above method wherein the step of determining connection code(s)pertaining to the said polylines and arcpolys includes the step ofcomputing accurate high resolution extreme points direction.

The above method wherein the step of computing accurate high resolutionextreme points direction includes the step of computing“direction_gradient.”

The above method wherein the step of registering (or grouping) the saidpoyline(s), their arcpoly(s) and their connection code(s) to eachalphanumeric ID includes the steps of: determining the Boolean variable“near” signifying a pair of polyline-to-polyline grouping when “near=1”and polyline-to-polyline isolation, otherwise; computing accurate depthdirection belonging to an arcpoly per polyline; and normalizing eacharcpoly's feature values pertaining to sizes per polyline.

The above method wherein the step of normalizing each arcpoly's featurevalues per polyline includes the step of computing alphanumeric IDheight threshold for upper and lower case alphanumeric symbol setdistinction.

The above method wherein the step of computing logical- and subclasssymbols and primary relational features for each arcpoly belonging toeach alphanumeric ID, each time a maximum of a single ‘logical symboloption’ and a pre-selected maximum number of ‘sub-class symbols options’generating one logical symbol and at most generating a few subclasssymbols, respectively includes the steps of: determining logical symbolfrom extreme point size and in certain situations from depth size per‘logical symbol option;’ determining sub-class symbol per ‘sub-classsymbols option;’ determining arcpoly structural variance cost value; andestablishing a ‘logical symbol and sub-class symbol(s) options’ discardcriteria;

The above method wherein the step of determining arcpoly structuralvariance cost value includes the steps of: deriving arcpoly shapevariance cost value per ‘sub-class symbols option;’ and deriving arcpolyrotation cost value in part from the imposed bi-polar auxiliary rotationunit that ranges from zero-to-four units per ‘logical symbol option.’

The above method wherein the step of deriving arcpoly shape variancecost value per ‘sub-class symbols option’ includes the steps of:computing extreme points size variance cost value; computing depth sizevariance cost value; and computing extension variance cost value.

The above method wherein the step of incorporating in database, modelsof alphanumeric symbols and support information for the handwritingrecognition process includes the steps of: producing generic model(s) ofalphanumeric symbols in accordance with the common-property conceptwhereby an alphanumeric symbol is identified by primitive elements andtheir relationships; producing exemplar (or case) models of alphanumericsymbols in accordance with the common-property concept, generating a setof representation options per alphanumeric symbol when integrated withthe generic model(s); deriving arcpoly structure-to-alphanumericmappings; deriving topology-to-alphanumeric mappings; and determiningcollective pertinent and context dependent evidence to aid thehandwriting recognition process.

The above method wherein the step of incorporating a multi-stagehierarchical confidence level capability manifesting as dissimilaritycost value for each alphanumeric ID and database alphanumeric candidatesymbol, thus enabling the set of alphanumeric candidate symbols' rankingfrom best-to-worst by using their derived secondary relational featuresincludes the steps of: computing secondary relational features; andranking database alphanumeric candidate symbols.

The above method wherein the step of computing secondary relationalfeatures for the said database alphanumerical candidate symbol and thealphanumeric ID includes the steps of: capturing for each arcpolybelonging to alphanumeric ID, for all said logical symbol options andsaid subclass symbols options, a series of said logical symbols, saidsubclass symbols, associated logical symbol option indices, andassociated subclass symbol option indices whereby any one of thealphanumeric symbols generated by the said arcpolystructure-to-alphanumeric mappings pertaining to the combined logical-and subclass symbols matches with the said database alphanumericcandidate symbol; capturing for each database alphanumeric symbolsrepresentation option, a series of said logical- and subclass-symbolspair(s) that result in a one-to-one match with the counterpart databaselogical- and subclass-symbols pair(s) using forward and in certainsituations backward search technique; identifying extra mismatchedarcpoly(s) and deriving cost values for each extra arcpoly and thecollective extra arcpoly(s); identifying missed database logical- andsubclass-symbols pair(s) and deriving cost values for each missedarcpoly and the collective missed logical- and subclass-symbols pair(s);deriving a new arcpoly structural variance comprising cost values forshape variance and rotation; establishing discard criteria for the saiddatabase alphanumeric candidate symbol; and computing variation costvalue.

The above method wherein the step of computing variation cost valueincludes the steps of: deriving threshold value; selecting appropriatepair(s) of arcpolys belonging to the said alphanumeric ID that directlytakes part in the variation cost value computation; establishing aone-to-one correspondence between the said pair(s) of arcpoly(s) anddatabase logical- and subclass-symbols pair(s) belonging to the saiddatabase alphanumeric candidate symbol; computing variation cost valuefor each of the said pair(s) of arcpoly(s) and database logical- andsubclass-symbols pair(s); computing variation cost value for each of themismatched pair(s) of arcpoly(s) and database logical- andsubclass-symbols pair(s); and integrating the said variation cost valuesto generate the total variation cost value.

The above method wherein the step of computing variation cost value foreach of the said pair(s) of arcpoly(s) and database logical- andsubclass-symbols pair(s) includes the steps of: determining codeconnection; and determining the x- and y-coordinate(s) of the majorpoint(s) on each arcpoly belonging to the said alphanumeric ID used forthe computation of variation cost value.

The above method wherein the step of determining the x- andy-coordinate(s) of the major point(s) on each arcpoly belonging to thesaid alphanumeric ID used for the computation of variation cost valueincludes the steps of: revising the original logical symbol with the‘logical symbol option’ index of zero; revising the said originallogical symbol and the said database logical- and subclass-symbols pair;and computing extreme points code.

The above method wherein the step of reducing the computed list ofalphanumeric candidate symbols' search range for each alphanumeric IDincludes the steps of: determining a list of alphanumeric symbols thatemerge repeatedly (or commonly) for every polyline and arcpoly by usingthe database's set of links from each arcpoly's pair of logical symbolsand sub-class symbols to their superset alphanumeric candidate symbol;and determining a possibly shorter list of alphanumeric symbols by crossreferencing the said list with the list of alphanumeric symbols thatemerge repeatedly (or commonly) for all code(s) per alphanumeric ID byusing the database's set of links from each encoding and separationpertaining to polyline and arcpoly relationship(s) to their supersetalphanumeric candidate symbols.

The above method wherein the step of determining a list of alphanumericsymbols that emerge repeatedly (or commonly) for every polyline andarcpoly includes the steps of: compiling a list of database alphanumericsymbols for each arcpoly using data generated by the said arcpolystructure-to-alphanumeric mappings pertaining to each of a series oflogical- and subclass-symbols pair(s) belonging to the said arcpoly; andcompiling a list of database alphanumeric symbols for each code by usingdata generated by the said topology-to-alphanumeric mappings pertainingto each of a series of logical- and subclass-symbols pair(s) belongingto the said arcpoly.

The above method wherein the step of compiling a list of databasealphanumeric symbols for each arcpoly is followed by the step ofcompiling a shorter list of alphanumeric symbol(s) that emerge(s)repeatedly (or commonly) for every arcpoly belonging to the saidalphanumeric ID.

The above method wherein the step of compiling a list of databasealphanumeric symbols for each arcpoly is followed by the step ofcompiling a shorter list of alphanumeric symbol(s) that emerge(s)repeatedly (or commonly) for every code belonging to the saidalphanumeric ID.

The above method wherein the step of computing alternative set(s) ofreduced lists of alphanumeric candidate symbols per alphanumeric IDincludes successive symbolic transformation of logical- andsubclass-symbols pair(s) to one another that includes arcpolystructural, and combined reshaping processes, incorporating the secondphase of the symbolic reshaping scheme.

The above method wherein the step of computing alternative set(s) ofreduced lists of alphanumeric candidate symbols is performed for eacharcpoly of the said alphanumeric ID, each time incorporating an additivebi-polar auxiliary rotation ranging in value between zero-to-four units.

The above method wherein the step of computing alternative set(s) ofreduced list of alphanumeric candidate symbols is performed for eacharcpoly of the said alphanumeric ID, each time incorporating an additivebi-polar auxiliary rotation ranging in value between zero-to-four unitsincludes the steps of: selecting a series of pre-determined number ofunused subclass symbol(s) (if any) each time per logical symbol andcomputing primary relational features, then computing alternative set(s)of reduced list of alphanumeric candidate symbols and their descriptorsand next computing secondary relational features as well as theirconfidence levels; and incorporating a series of extreme points size anddepth size variances to the arcpoly belonging to the said alphanumericID, computing primary relational features and alternative set(s) ofreduced list of alphanumeric candidate symbols and next computing theirdescriptors and secondary relational features as well as theirconfidence levels.

While the present invention has been described and shown in connectionwith specific embodiments thereof, it will be understood that it iscapable of further modification, and this application is capable offurther modification, and this application is intended to cover anyvariations, uses, or adaptations of the invention following, in general,the principles of the invention and including such departures from thepresent invention as would be understood to those skilled in the art asequivalent and the scope and context of the present invention is to beinterpreted as including such equivalents and construed in accordancewith and encompassed by the claims appended hereto. Therefore, it is theobject of the appended claims to cover all such various alternatives,variations, and modifications of the present invention as are within thespirit and scope of the present invention.

1. A method of automatically recognizing alphanumeric symbols,comprising: (a) providing a set of logical symbols comprising a finiteclass of arcpolys, wherein the class of arcpolys comprises arcs, linesand points; (b) providing a set of subclass symbols per logical symbolrepresenting a finite subclass of arcpolys, each subclass member havinga unique extreme points size and/or depth size; (c) providing a digitalrepresentation of a set of unrecognized alphanumeric symbols; (d)automatically classifying the arcpolys of each unrecognized alphanumericsymbol into one or more pairs of logical and subclass symbols such thateach unrecognized alphanumeric symbol can be recognized; and (e)providing a set of topological relationships for each pair of arcpolyseach comprising a one-of-nine topological connection code andseparation, and wherein topological relational features are alsoautomatically classified.
 2. The method of claim 1, wherein each pair oflogical and subclass symbols is characterized by a set of primaryfeatures including at least the following group of features: (a) extremepoints direction, (b) extreme points size, (c) depth direction, and (d)depth size.
 3. The method of claim 2, wherein the primary featuresfurther include at least one of: (e) extension and (f) motion clockwise.4. A method of automatically recognizing alphanumeric symbols,comprising: receiving a digital representation of a set of unrecognizedalphanumeric symbols; computing a set of arcpolys for each unrecognizedalphanumeric symbol, wherein the set of arcpolys is a subset of theclass of arcpolys which comprises arcs, lines and points; computing afeature set based on one or more sets of primary features for eachunrecognized alphanumeric symbol; computing a symbolic representationfor each unrecognized alphanumeric symbol so that the unrecognizedalphanumeric symbols can be recognized; and providing a set oftopological relationships for each pair of arcpolys each comprising aone-of-nine topological connection code and separation, and whereintopological relational features are also automatically classified. 5.The method of claim 4, wherein the computing a feature set comprises:normalizing the primary features sizes of the arcpolys, wherein primaryfeatures represent shape and orientation of the arcpoly; grouping thenormalized primary features of the arcpolys into each unrecognizedalphanumeric symbol; determining topological relationships for each pairof arcpolys; and grouping the topological relationships of arcpolypair(s) into each unrecognized alphanumeric symbol.
 6. The method ofclaim 5, wherein the computing a feature set additionally comprisescriteria-based region growing and splitting method to achieve arcpolysthat better conform to a plurality of alphanumeric symbol models.
 7. Themethod of claim 4, wherein the computing a symbolic representationcomprises for each arcpoly of each polyline of each unrecognizedalphanumeric symbol, computing primary relational features from theunrecognized alphanumeric symbol's feature set per arcpoly.
 8. Themethod of claim 4, wherein the computing symbolic representations foreach arcpoly of each polyline of each unrecognized symbol comprisescomputing one or more pairs of logical and subclass symbols.
 9. Themethod of claim 4, additionally comprising: for each arcpoly of eachpolyline of each unrecognized alphanumeric symbol: accessing a storedcandidate alphanumeric list; computing a reduced alphanumeric candidatelist from a database of alphanumeric symbol models; and computing one ormore pairs of logical and subclass symbols and secondary relationalfeatures for each candidate of the reduced alphanumeric candidate list.10. The method of claim 9, wherein the computing pairs of logical andsubclass symbols and secondary relational features comprises: for eacharcpoly of each polyline of each unrecognized alphanumeric symbol:computing secondary relational features comprising topological varianceand arcpoly dissimilarity value representing inferred confidence level,as each unrecognized alphanumeric symbol is paired with each candidatealphanumeric symbol from the database; and discarding candidatealphanumeric symbols to reduce the candidate alphanumeric list whenselective feature values of the secondary relational feature set basedon each candidate alphanumeric symbol exceed preset criteria-basedthresholds.
 11. The method of claim 10, wherein the secondary relationalfeatures are used to derive the alphanumeric dissimilarity value basedon each candidate alphanumeric symbol.
 12. A computerized databasestored in a digital storage medium and accessed by a computing device toautomatically recognize alphanumeric symbols, comprising: a set oflogical symbols comprising a finite class of arcpolys, wherein the classof arcpolys comprises arcs, lines and points; a set of subclass symbolsper logical symbol representing a finite subclass of arcpolys, eachsubclass member having a unique extreme points size and/or depth size;wherein each subclass symbol is characterized by a group of featuresincluding motion clockwise; and wherein a set of topologicalrelationships for each pair of arcpolys each comprises a one-of-ninetopological connection code and separation, and wherein topologicalrelational features are also automatically classified.
 13. The method ofclaim 12, additionally comprising a set of variances comprising a set ofarcpoly unit variance types, a set of counterpart dissimilarity valuesand a unit topological dissimilarity value per pair of arcpolys.
 14. Themethod of claim 1, wherein the automatically classifying alphanumericscomprises: computing a set of arcpolys for each unrecognizedalphanumeric symbol; computing a feature set based on one or more setsof primary features for each unrecognized alphanumeric symbol; andcomputing a symbolic representation for each unrecognized alphanumericsymbol so that the unrecognized alphanumeric symbols can be recognized.15. A system for automatically recognizing alphanumeric symbols,comprising: means for providing a set of logical symbols comprising afinite class of arcpolys, wherein the class of arcpolys comprises arcs,lines and points; means for providing a set of subclass symbols perlogical symbol representing a finite subclass of arcpolys, each subclassmember having a unique extreme points size and/or depth size; means forproviding a digital representation of a set of unrecognized alphanumericsymbols; means for automatically classifying the arcpolys of eachunrecognized alphanumeric symbol into one or more pairs of logical andsubclass symbols such that each unrecognized alphanumeric symbol can berecognized; and means for providing a set of topological relationshipsfor each pair of arcpolys each comprising a one-of-nine topologicalconnection code and separation, and wherein topological relationalfeatures are also automatically classified.
 16. The method of claim 15,wherein each pair of logical and subclass symbols is primarilycharacterized by a set of primary features including at least thefollowing group of features: (a) extreme points direction, (b) extremepoints size, (c) depth direction, and (d) depth size.
 17. The method ofclaim 16, wherein the primary features further include at least one of:(e) extension and (f) motion clockwise.
 18. A system for automaticallyrecognizing alphanumeric symbols, comprising: means for receiving adigital representation of a set of unrecognized alphanumeric symbols;means for computing a set of arcpolys for each unrecognized alphanumericsymbol, wherein the set of arcpolys is a subset of the class of arcpolyswhich comprises arcs, lines and points; means for computing a featureset based on one or more sets of primary features for each unrecognizedalphanumeric symbol; means for computing a symbolic representation foreach unrecognized alphanumeric symbol so that the unrecognizedalphanumeric symbols can be recognized; and means for providing a set oftopological relationships for each pair of arcpolys each comprising aone-of-nine topological connection code and separation, and whereintopological relational features are also automatically classified. 19.The system of claim 18, wherein the computing a feature set comprises:means for normalizing the primary features sizes of the arcpolys; meansfor grouping the normalized primary features of the arcpolys into eachunrecognized alphanumeric symbol; means for determining topologicalrelationships for each pair of arcpolys; and means for grouping thetopological relationships of arcpoly pair(s) into each unrecognizedalphanumeric symbol.
 20. The system of claim 18, wherein the means forcomputing symbolic representations for each arcpoly of each polyline ofeach unrecognized symbol comprises means for computing one or more pairsof logical and subclass symbols.
 21. A system for automaticallyrecognizing alphanumeric symbols, comprising: a first data storagehaving a set of logical symbols comprising a finite class of arcpolys,wherein the class of arcpolys comprises arcs, lines and points; a seconddata storage having a set of subclass symbols per logical symbolrepresenting a finite subclass of arcpolys, each subclass member havinga unique extreme points size and/or depth size; a third data storagehaving a digital representation of a set of unrecognized alphanumericsymbols; a fourth data storage having structural and topologicalmulti-type variances and counterpart dissimilarity values comprising thefollowing: (a) unit change extreme points size, (b) unit change depthsize, (c) extra image structure size, (d) missing stored symbol size,(e) unit change single extreme point position, (f) unit change singleextreme point extension, and (g) unit rotation, and program codeaccessing the data storages and adapted to automatically classify thearcpolys of each unrecognized alphanumeric symbol into one or more pairsof logical and subclass symbols such that each unrecognized alphanumericsymbol can be recognized.
 22. The method of claim 4, wherein thecomputing a symbolic representation for each unrecognized alphanumericcomprises computing one or more pairs of logical and subclass symbolsper arcpoly.
 23. The method of claim 1, wherein each arc and line memberof the logical symbol set has a unique orientation.
 24. The computerizeddatabase of claim 12, wherein each arc and line member of the logicalsymbol set has a unique orientation.
 25. The computerized database ofclaim 12, wherein each subclass symbol is additionally characterized bythe feature of extension.
 26. The system of claim 15, wherein each arcand line member of the logical symbol set has a unique orientation. 27.The system of claim 21, wherein each arc and line member of the logicalsymbol set has a unique orientation.